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 13, 2026 21:30Victor MerckléVictor MerckléScore: 7,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 21:317,59570,303,41662,009,0001,031,0002,113,536
2May 13, 2026 21:317,59871,657,08462,062,0001,007,0002,113,536
3May 13, 2026 21:317,59870,303,02563,069,00002,113,536
4May 13, 2026 21:317,59970,435,69462,067,0001,011,0002,113,536
5May 13, 2026 21:317,60071,139,64962,043,0001,045,0002,113,536
6May 13, 2026 21:317,60671,504,79762,133,0001,005,0002,113,536
7May 13, 2026 21:317,61073,039,01062,153,0001,010,0002,113,536
8May 13, 2026 21:317,61571,365,37662,160,0001,045,0002,113,536
9May 13, 2026 21:317,72773,480,17863,133,0001,007,0002,113,536