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 24, 2026 13:19Victor MerckléVictor MerckléScore: 5,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 13:205,58056,127,33045,241,0001,076,0002,113,536
2May 24, 2026 13:205,60354,348,25145,471,0001,034,0002,113,536
3May 24, 2026 13:205,61556,391,28945,604,0001,001,0002,113,536
4May 24, 2026 13:205,61656,354,47145,609,0001,006,0002,113,536
5May 24, 2026 13:205,61955,002,94645,616,0001,026,0002,113,536
6May 24, 2026 13:205,62054,447,69145,625,0001,027,0002,113,536
7May 24, 2026 13:205,62054,487,29645,652,0001,002,0002,113,536
8May 24, 2026 13:205,62956,600,21345,714,0001,009,0002,113,536
9May 24, 2026 13:205,63054,582,16345,672,0001,061,0002,113,536