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 listSep 24, 2026 06:01wnwnScore: 4,315Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 06:084,22443,835,76127,169,0007,895,0002,113,536
2Sep 24, 2026 06:084,23643,914,44827,063,0008,096,0002,113,536
3Sep 24, 2026 06:084,24944,015,51527,304,0007,966,00020,480
4Sep 24, 2026 06:084,30044,486,81927,329,0008,365,0002,113,536
5Sep 24, 2026 06:084,31544,518,20427,489,0008,327,0002,113,536
6Sep 24, 2026 06:084,34445,432,55228,343,0007,720,00020,480
7Sep 24, 2026 06:084,36945,093,46628,459,0007,806,00020,480
8Sep 24, 2026 06:084,42745,526,97928,719,0008,029,0002,113,536
9Sep 24, 2026 06:084,48545,746,77928,509,0008,724,0002,113,536