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 listFeb 11, 2026 19:11olliecrowolliecrowScore: 6,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 19:115,88172,810,78145,825,0002,988,0002,404,352
2Feb 11, 2026 19:115,91174,855,10146,058,0003,003,0002,330,624
3Feb 11, 2026 19:116,19578,520,61148,391,0003,024,0002,494,464
4Feb 11, 2026 19:116,24079,601,48450,798,000996,0002,510,848
5Feb 11, 2026 19:116,31277,206,35149,368,0003,022,0002,420,736
6Feb 11, 2026 19:116,42279,069,47751,292,0002,011,0002,502,656