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 5, 2026 13:16wnwnScore: 3,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 13:173,31535,989,34526,516,0001,006,0002,113,536
2Sep 5, 2026 13:173,32636,060,95926,568,0001,040,0002,113,536
3Sep 5, 2026 13:173,33836,202,63626,583,0001,127,0002,113,536
4Sep 5, 2026 13:173,50238,128,04028,037,0001,035,0002,113,536
5Sep 5, 2026 13:173,50637,330,03428,074,0001,034,0002,113,536
6Sep 5, 2026 13:173,50639,234,76628,097,0001,004,0002,113,536
7Sep 5, 2026 13:173,51037,570,11828,110,0001,031,0002,113,536
8Sep 5, 2026 13:173,55638,217,46928,517,0001,002,0002,113,536
9Sep 5, 2026 13:173,61248,546,12428,908,0001,079,0002,113,536