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 19:16Juraj ZelmanJuraj ZelmanScore: 9,433Success
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 19:169,379103,256,00675,851,0001,996,0002,355,200
2Feb 18, 2026 19:169,395107,454,57875,982,0001,999,0002,367,488
3Feb 18, 2026 19:169,416108,052,28476,151,0002,003,0002,293,760
4Feb 18, 2026 19:169,416106,727,65877,152,0001,001,0002,367,488
5Feb 18, 2026 19:169,426102,971,55376,229,0002,006,0002,293,760
6Feb 18, 2026 19:169,426107,132,77677,236,0001,003,0002,375,680
7Feb 18, 2026 19:169,433104,195,36576,284,0002,007,0002,363,392
8Feb 18, 2026 19:169,435105,877,06976,300,0002,007,0002,355,200
9Feb 18, 2026 19:169,436104,402,55878,317,00002,367,488
10Feb 18, 2026 19:169,450102,406,46677,432,0001,005,0002,367,488
11Feb 18, 2026 19:169,560105,442,97278,342,0001,004,0002,375,680
12Feb 18, 2026 19:1611,151121,375,24492,550,00002,293,760