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:31Juraj ZelmanJuraj ZelmanScore: 8,970Success
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:318,94593,784,14273,240,0001,003,0002,293,760
2Feb 18, 2026 20:318,94695,635,28373,246,0001,003,0002,371,584
3Feb 18, 2026 20:318,94993,880,58773,277,0001,003,0002,363,392
4Feb 18, 2026 20:318,964102,326,05572,393,0002,010,0002,371,584
5Feb 18, 2026 20:318,964105,697,83573,397,0001,005,0002,285,568
6Feb 18, 2026 20:318,96897,259,69973,428,0001,005,0002,285,568
7Feb 18, 2026 20:318,970100,803,85373,445,0001,006,0002,293,760
8Feb 18, 2026 20:318,97195,044,43874,458,00002,293,760
9Feb 18, 2026 20:318,97296,218,83873,459,0001,006,0002,285,568
10Feb 18, 2026 20:318,97694,805,22573,497,0001,006,0002,293,760
11Feb 18, 2026 20:318,98397,685,35574,555,00002,355,200
12Feb 18, 2026 20:318,985102,733,96573,565,0001,007,0002,293,760