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 listJul 7, 2026 10:22Victor MerckléVictor MerckléScore: 4,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 10:224,46345,161,86835,999,0001,051,0002,117,632stderr
2Jul 7, 2026 10:224,47145,373,44236,056,0001,060,0002,117,632stderr
3Jul 7, 2026 10:224,47445,283,89636,076,0001,063,0002,117,632stderr
4Jul 7, 2026 10:224,50145,415,11536,207,0001,158,0002,117,632stderr
5Jul 7, 2026 10:224,50545,545,15136,343,0001,055,0002,117,632stderr
6Jul 7, 2026 10:224,51245,486,56136,390,0001,060,0002,117,632stderr
7Jul 7, 2026 10:224,52745,674,77336,554,0001,021,0002,117,632stderr
8Jul 7, 2026 10:224,52846,981,30836,415,0001,172,0002,117,632stderr
9Jul 7, 2026 10:224,70646,947,01638,051,0001,013,0002,117,632stderr