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 listSep 8, 2026 17:43Victor MerckléVictor MerckléScore: 3,693Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 17:503,65338,880,38329,313,0001,015,0002,121,728stderr
2Sep 8, 2026 17:503,66838,705,88629,426,0001,020,0002,121,728stderr
3Sep 8, 2026 17:503,68439,404,04029,552,0001,029,0002,121,728stderr
4Sep 8, 2026 17:503,68839,003,86029,591,0001,025,0002,121,728stderr
5Sep 8, 2026 17:503,69339,200,49529,613,0001,040,0002,121,728stderr
6Sep 8, 2026 17:503,69539,068,56629,618,0001,051,0002,121,728stderr
7Sep 8, 2026 17:503,69639,235,44629,663,0001,022,0002,121,728stderr
8Sep 8, 2026 17:503,70139,300,34329,682,0001,043,0002,121,728stderr
9Sep 8, 2026 17:503,70439,081,05229,724,0001,026,0002,121,728stderr