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 listOct 11, 2025 13:21e1011e1011Score: 73,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2025 13:2173,923637,234,109557,603,00055,960,0002,285,568
2Oct 11, 2025 13:2173,928635,834,550556,642,00056,963,0002,285,568
3Oct 11, 2025 13:2173,942639,301,917549,749,00063,970,0002,269,184
4Oct 11, 2025 13:2173,957638,053,107554,862,00058,985,0002,260,992
5Oct 11, 2025 13:2173,965635,505,811556,915,00056,991,0002,277,376
6Oct 11, 2025 13:2173,972637,328,746555,968,00057,996,0002,260,992
7Oct 11, 2025 13:2173,988645,964,049553,093,00061,010,0002,277,376
8Oct 11, 2025 13:2174,011639,795,310558,266,00056,026,0002,367,488
9Oct 11, 2025 13:2174,032640,034,940554,521,00059,948,0002,285,568