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 listMar 21, 2026 10:53olliecrowolliecrowScore: 6,001Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 10:525,93170,708,77046,217,0003,014,0002,293,760
2Mar 21, 2026 10:565,94773,162,99544,325,0005,037,0002,498,560
3Mar 21, 2026 10:565,95370,045,59946,389,0003,025,0002,514,944
4Mar 21, 2026 10:565,96077,074,56246,438,0003,028,0002,510,848
5Mar 21, 2026 10:545,96475,992,98546,470,0003,030,0002,297,856
6Mar 21, 2026 10:525,99973,978,01245,806,0003,983,0002,359,296
7Mar 21, 2026 10:546,00179,386,91347,815,0001,992,0002,355,200
8Mar 21, 2026 10:546,00372,671,49147,830,0001,992,0002,359,296
9Mar 21, 2026 10:536,00874,184,47147,876,0001,994,0002,400,256
10Mar 21, 2026 10:536,05978,064,69347,272,0003,017,0002,351,104
11Mar 21, 2026 10:536,08873,962,36447,498,0003,031,0002,527,232
12Mar 21, 2026 10:526,31781,546,21446,379,0006,049,0002,318,336