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 22, 2026 12:01wnwnScore: 3,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 12:053,75246,363,19229,136,0002,009,0002,486,272
2Apr 22, 2026 12:053,75348,795,85129,142,0002,009,0002,482,176
3Apr 22, 2026 12:053,76951,055,68330,278,0001,009,0002,486,272
4Apr 22, 2026 12:053,76948,867,45930,274,0001,009,0002,482,176
5Apr 22, 2026 12:053,78546,588,42130,407,0001,013,0002,486,272
6Apr 22, 2026 12:053,80050,635,31630,528,0001,017,0002,494,464
7Apr 22, 2026 12:053,80344,105,28130,553,0001,018,0002,494,464
8Apr 22, 2026 12:053,86548,342,52230,077,0002,005,0002,478,080
9Apr 22, 2026 12:053,86650,436,89730,085,0002,005,0002,330,624