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 listMay 13, 2026 21:10Victor MerckléVictor MerckléScore: 7,730Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 21:117,72574,661,56962,985,0001,135,0002,117,632stderr
2May 13, 2026 21:117,72673,032,20363,011,0001,117,0002,117,632stderr
3May 13, 2026 21:117,72672,732,60663,067,0001,065,0002,117,632stderr
4May 13, 2026 21:117,72774,238,16263,025,0001,117,0002,117,632stderr
5May 13, 2026 21:117,73074,340,06363,027,0001,135,0002,117,632stderr
6May 13, 2026 21:117,74471,389,58463,154,0001,124,0002,117,632stderr
7May 13, 2026 21:117,81173,663,25663,723,0001,110,0002,117,632stderr
8May 13, 2026 21:117,83574,223,52263,925,0001,108,0002,117,632stderr
9May 13, 2026 21:117,90077,215,31664,442,0001,132,0002,117,632stderr