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 listFeb 24, 2026 16:18spatialspatialScore: 95,365Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 16:1894,480809,255,468553,424,000230,759,0002,473,984
2Feb 24, 2026 16:1894,676812,991,187554,864,000230,943,0002,469,888
3Feb 24, 2026 16:1894,795811,564,071554,859,000231,941,0002,469,888
4Feb 24, 2026 16:1894,959811,232,246553,410,000234,750,0002,461,696
5Feb 24, 2026 16:1895,365819,722,569553,673,000237,859,0002,285,568
6Feb 24, 2026 16:1895,622823,179,967553,764,000239,897,0002,478,080
7Feb 24, 2026 16:1896,171827,983,885554,456,000243,761,0002,379,776
8Feb 24, 2026 16:1896,208825,889,340557,669,000240,857,0002,400,256
9Feb 24, 2026 16:1896,974835,096,510559,228,000245,660,0002,465,792