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 21, 2026 12:53Victor MerckléVictor MerckléScore: 4,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 12:534,64748,602,52837,511,0001,063,0002,113,536
2May 21, 2026 12:534,64747,058,05437,505,0001,068,0002,113,536
3May 21, 2026 12:534,65247,998,44737,545,0001,069,0002,113,536
4May 21, 2026 12:534,65347,065,45837,546,0001,076,0002,113,536
5May 21, 2026 12:534,65548,493,89937,560,0001,077,0002,113,536
6May 21, 2026 12:534,66848,288,24337,733,0001,013,0002,113,536
7May 21, 2026 12:534,67148,245,99037,736,0001,034,0002,113,536
8May 21, 2026 12:534,67346,712,95937,786,0001,004,0002,113,536
9May 21, 2026 12:534,89151,352,81039,572,0001,025,0002,113,536