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 14, 2026 03:43Victor MerckléVictor MerckléScore: 7,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 03:447,16867,994,60759,499,00002,113,536
2May 14, 2026 03:447,17068,326,26659,512,00002,113,536
3May 14, 2026 03:447,17069,562,29758,468,0001,044,0002,113,536
4May 14, 2026 03:447,17567,524,95258,507,0001,049,0002,113,536
5May 14, 2026 03:447,17766,873,44958,522,0001,052,0002,113,536
6May 14, 2026 03:447,19880,916,01958,680,0001,071,0002,113,536
7May 14, 2026 03:447,21469,082,94359,884,00002,113,536
8May 14, 2026 03:447,21669,397,04759,901,00002,113,536
9May 14, 2026 03:447,33170,735,51859,804,0001,044,0002,113,536