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 13, 2026 19:38wnwnScore: 4,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 19:234,31856,332,94733,847,0001,991,0002,486,272
2Mar 13, 2026 19:074,32161,092,10434,844,0001,024,0002,273,280
3Mar 13, 2026 19:234,32560,412,94633,907,0001,994,0002,273,280
4Mar 13, 2026 19:384,33159,315,34633,949,0001,997,0002,486,272
5Mar 13, 2026 19:074,33560,051,60633,980,0001,998,0002,273,280
6Mar 13, 2026 19:384,33857,413,88634,006,0002,000,0002,498,560
7Mar 13, 2026 19:384,34361,708,49234,042,0002,002,0002,527,232
8Mar 13, 2026 19:074,35757,570,45434,157,0002,009,0002,273,280
9Mar 13, 2026 19:234,35968,336,54436,181,00002,273,280