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 26, 2026 18:08Victor MerckléVictor MerckléScore: 7,056Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 18:096,98466,300,98656,816,0001,159,0002,117,632stderr
2Aug 26, 2026 18:097,00567,209,19856,993,0001,152,0002,117,632stderr
3Aug 26, 2026 18:097,00566,425,17256,964,0001,183,0002,117,632stderr
4Aug 26, 2026 18:097,01766,447,70756,981,0001,264,0002,117,632stderr
5Aug 26, 2026 18:097,05667,621,95357,428,0001,145,0002,117,632stderr
6Aug 26, 2026 18:097,05866,739,09757,400,0001,182,0002,117,632stderr
7Aug 26, 2026 18:097,06266,731,37057,497,0001,124,0002,117,632stderr
8Aug 26, 2026 18:097,07666,881,62657,573,0001,159,0002,117,632stderr
9Aug 26, 2026 18:097,19367,845,14958,619,0001,083,0002,117,632stderr