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:54wnwnScore: 3,460Success
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:553,40444,703,60727,249,0001,009,0002,486,272
2Apr 27, 2026 05:553,41049,272,29727,296,0001,010,0002,490,368
3Apr 27, 2026 05:553,44045,987,26827,536,0001,019,0002,494,464
4Apr 27, 2026 05:553,45345,107,85827,643,0001,023,0002,486,272
5Apr 27, 2026 05:553,46045,420,48826,741,0001,980,0002,486,272
6Apr 27, 2026 05:553,46442,624,28126,773,0001,983,0002,490,368
7Apr 27, 2026 05:553,54448,863,60328,402,0001,014,0002,482,176
8Apr 27, 2026 05:553,60543,714,15227,933,0001,995,0002,314,240
9Apr 27, 2026 05:553,67344,578,42129,474,0001,016,0002,490,368