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 17, 2026 14:16Victor MerckléVictor MerckléScore: 7,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 14:267,41670,420,86660,480,0001,076,0002,113,536
2May 17, 2026 14:267,41670,469,76160,466,0001,091,0002,113,536
3May 17, 2026 14:267,41769,008,81360,479,0001,087,0002,113,536
4May 17, 2026 14:267,41869,740,13060,504,0001,071,0002,113,536
5May 17, 2026 14:267,42070,115,67460,509,0001,084,0002,113,536
6May 17, 2026 14:267,42168,755,12660,510,0001,088,0002,113,536
7May 17, 2026 14:267,44270,769,24060,656,0001,113,0002,113,536
8May 17, 2026 14:267,47571,068,18960,953,0001,097,0002,113,536
9May 17, 2026 14:267,47769,295,41360,986,0001,076,0002,113,536