Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 24, 2026 17:54Victor MerckléVictor MerckléScore: 4,489Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 17:554,43345,124,73835,689,0001,106,0002,117,632stderr
2Aug 24, 2026 17:554,43945,149,28435,798,0001,051,0002,117,632stderr
3Aug 24, 2026 17:554,47645,475,48936,116,0001,038,0002,117,632stderr
4Aug 24, 2026 17:554,48445,616,94136,179,0001,045,0002,117,632stderr
5Aug 24, 2026 17:554,48945,573,41936,211,0001,053,0002,117,632stderr
6Aug 24, 2026 17:554,49445,582,01136,243,0001,058,0002,117,632stderr
7Aug 24, 2026 17:554,64546,878,24637,519,0001,041,0002,117,632stderr
8Aug 24, 2026 17:554,69847,254,12437,969,0001,029,0002,117,632stderr
9Aug 24, 2026 17:554,69847,248,61337,909,0001,085,0002,117,632stderr