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 listApr 27, 2026 05:48wnwnScore: 3,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 05:493,41743,554,59527,355,0001,013,0002,555,904
2Apr 27, 2026 05:493,41845,284,05527,362,0001,013,0002,486,272
3Apr 27, 2026 05:493,43949,424,17627,532,0001,019,0002,490,368
4Apr 27, 2026 05:493,44946,825,19727,605,0001,022,0002,490,368
5Apr 27, 2026 05:493,45541,707,97727,653,0001,024,0002,486,272
6Apr 27, 2026 05:493,46542,095,02226,778,0001,983,0002,494,464
7Apr 27, 2026 05:493,49647,814,20127,020,0002,001,0002,482,176
8Apr 27, 2026 05:493,63742,641,92129,182,0001,006,0002,490,368
9Apr 27, 2026 05:493,64447,624,58930,251,00002,473,984