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 13:47Victor MerckléVictor MerckléScore: 4,645Success
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 13:484,64048,331,43537,449,0001,071,0002,113,536
2May 21, 2026 13:484,64347,798,49237,471,0001,068,0002,113,536
3May 21, 2026 13:484,64447,372,70937,483,0001,069,0002,113,536
4May 21, 2026 13:484,64446,567,48437,491,0001,057,0002,113,536
5May 21, 2026 13:484,64546,979,48637,487,0001,068,0002,113,536
6May 21, 2026 13:484,65048,504,52437,526,0001,074,0002,113,536
7May 21, 2026 13:484,65348,666,02337,555,0001,071,0002,113,536
8May 21, 2026 13:484,65548,122,20637,566,0001,071,0002,113,536
9May 21, 2026 13:484,66248,052,77037,665,0001,033,0002,113,536