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 06:09Victor MerckléVictor MerckléScore: 7,004Success
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 06:096,99167,667,21857,019,0001,009,0002,113,536
2May 14, 2026 06:096,99365,310,56457,008,0001,035,0002,113,536
3May 14, 2026 06:096,99666,174,15958,067,00002,113,536
4May 14, 2026 06:096,99967,549,22357,073,0001,025,0002,113,536
5May 14, 2026 06:097,00467,539,31357,121,0001,014,0002,113,536
6May 14, 2026 06:097,00667,274,35857,122,0001,034,0002,113,536
7May 14, 2026 06:097,00666,086,96057,124,0001,029,0002,113,536
8May 14, 2026 06:097,04467,544,56257,471,0001,000,0002,113,536
9May 14, 2026 06:097,14367,877,65158,254,0001,036,0002,113,536