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 listAug 27, 2026 03:47Victor MerckléVictor MerckléScore: 3,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 03:473,68539,735,03329,451,0001,142,0002,113,536
2Aug 27, 2026 03:473,69438,973,04029,598,0001,069,0002,113,536
3Aug 27, 2026 03:473,69939,717,96329,533,0001,169,0002,113,536
4Aug 27, 2026 03:473,70038,992,35529,657,0001,060,0002,113,536
5Aug 27, 2026 03:473,70338,932,23929,578,0001,160,0002,113,536
6Aug 27, 2026 03:473,71339,027,81129,729,0001,093,0002,113,536
7Aug 27, 2026 03:473,72439,112,49929,843,0001,071,0002,113,536
8Aug 27, 2026 03:473,73539,151,39529,934,0001,070,0002,113,536
9Aug 27, 2026 03:473,77539,653,32530,267,0001,067,0002,113,536