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 listJul 5, 2026 20:41Kevin HeaveyKevin HeaveyScore: 135,033Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:43134,1831,123,364,9771,112,714,0001,005,0002,121,728stderr
2Jul 5, 2026 20:43134,1951,123,471,3181,112,816,0001,004,0002,121,728stderr
3Jul 5, 2026 20:43134,7771,128,404,2031,117,656,0001,001,0002,121,728stderr
4Jul 5, 2026 20:43134,8271,128,769,5581,118,063,0001,007,0002,121,728stderr
5Jul 5, 2026 20:43135,0331,130,275,1071,119,775,0001,005,0002,121,728stderr
6Jul 5, 2026 20:43135,2371,141,421,3361,121,470,0001,000,0002,121,728stderr
7Jul 5, 2026 20:43135,2671,132,362,7991,121,673,0001,045,0002,121,728stderr
8Jul 5, 2026 20:43137,9201,154,259,5171,143,736,0001,002,0002,121,728stderr
9Jul 5, 2026 20:43143,5351,211,008,2971,190,338,0001,003,0002,121,728stderr