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:31wnwnScore: 3,449Success
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:313,40640,055,19327,267,0001,009,0002,478,080
2Apr 27, 2026 05:313,42844,331,82927,439,0001,016,0002,314,240
3Apr 27, 2026 05:313,44741,522,16227,594,0001,022,0002,486,272
4Apr 27, 2026 05:313,44845,662,83627,599,0001,022,0002,490,368
5Apr 27, 2026 05:313,44943,761,51527,612,0001,022,0002,494,464
6Apr 27, 2026 05:313,46844,163,34026,803,0001,985,0002,482,176
7Apr 27, 2026 05:313,48640,868,66527,941,000997,0002,330,624
8Apr 27, 2026 05:313,50743,780,20727,104,0002,007,0002,486,272
9Apr 27, 2026 05:313,62546,312,75928,087,0002,006,0002,498,560