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 listSep 12, 2026 00:16Victor MerckléVictor MerckléScore: 23,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 00:2023,137201,974,589190,944,0001,096,0002,117,632stderr
2Sep 12, 2026 00:2023,143201,836,082191,077,0001,011,0002,117,632stderr
3Sep 12, 2026 00:2023,180202,203,853191,349,0001,049,0002,117,632stderr
4Sep 12, 2026 00:2023,183202,174,327191,397,0001,026,0002,117,632stderr
5Sep 12, 2026 00:2023,191202,215,751191,470,0001,021,0002,117,632stderr
6Sep 12, 2026 00:2023,222202,557,278191,744,0001,006,0002,117,632stderr
7Sep 12, 2026 00:2023,232203,252,408191,745,0001,088,0002,117,632stderr
8Sep 12, 2026 00:2023,298203,366,723192,290,0001,084,0002,117,632stderr
9Sep 12, 2026 00:2023,302203,375,351192,371,0001,042,0002,117,632stderr