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 09:56wnwnScore: 7,267Success
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 09:566,24676,514,72650,828,0001,016,0002,396,160
2Feb 18, 2026 09:566,36284,032,90550,814,0001,992,0002,506,752
3Feb 18, 2026 09:566,36376,684,12449,828,0002,989,0002,514,944
4Feb 18, 2026 09:567,26784,211,34958,308,0002,010,0002,420,736
5Feb 18, 2026 09:567,28087,336,88556,400,0004,028,0002,408,448
6Feb 18, 2026 09:567,32786,696,52157,822,0002,990,0002,482,176