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 11, 2026 20:25Victor MerckléVictor MerckléScore: 10,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 20:2510,22493,598,31883,763,0001,104,0002,113,536
2May 11, 2026 20:2510,22794,959,84083,796,0001,095,0002,113,536
3May 11, 2026 20:2510,23093,771,71483,801,0001,110,0002,113,536
4May 11, 2026 20:2510,23795,587,92783,798,0001,176,0002,113,536
5May 11, 2026 20:2510,23894,511,91783,803,0001,178,0002,113,536
6May 11, 2026 20:2510,24093,773,79483,818,0001,176,0002,113,536
7May 11, 2026 20:2510,24793,855,35183,966,0001,090,0002,113,536
8May 11, 2026 20:2510,25894,257,17884,032,0001,117,0002,113,536
9May 11, 2026 20:2510,27396,190,08084,089,0001,178,0002,113,536