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 24, 2026 13:58Victor MerckléVictor MerckléScore: 4,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 13:594,55745,869,36536,772,0001,059,0002,113,536
2May 24, 2026 13:594,56745,787,34136,835,0001,078,0002,113,536
3May 24, 2026 13:594,57345,833,50336,903,0001,061,0002,113,536
4May 24, 2026 13:594,57746,649,94336,940,0001,057,0002,113,536
5May 24, 2026 13:594,58145,909,00736,959,0001,070,0002,113,536
6May 24, 2026 13:594,59246,773,94937,066,0001,054,0002,113,536
7May 24, 2026 13:594,59445,936,35037,110,0001,021,0002,113,536
8May 24, 2026 13:594,59948,169,72437,108,0001,069,0002,113,536
9May 24, 2026 13:594,60046,002,26837,121,0001,061,0002,113,536