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 18, 2026 20:09Juraj ZelmanJuraj ZelmanScore: 9,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 20:099,419109,028,74375,173,0003,006,0002,551,808
2Feb 18, 2026 20:099,422104,513,79777,202,0001,002,0002,551,808
3Feb 18, 2026 20:099,428109,377,28577,250,0001,003,0002,555,904
4Feb 18, 2026 20:099,445107,560,73076,385,0002,010,0002,347,008
5Feb 18, 2026 20:099,448107,330,68677,411,0001,005,0002,560,000
6Feb 18, 2026 20:099,465111,438,15978,559,00002,347,008