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 15, 2025 12:18sheryllynn24sheryllynn24Score: 2,068,896Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2025 12:182,065,02717,175,761,22417,079,755,00059,971,0002,277,376
2Sep 15, 2025 12:182,065,89917,185,904,04717,077,000,00069,963,0002,277,376
3Sep 15, 2025 12:182,065,95717,176,782,29817,084,470,00062,972,0002,285,568
4Sep 15, 2025 12:182,068,33617,203,117,50217,108,219,00058,966,0002,285,568
5Sep 15, 2025 12:182,068,89617,205,865,52917,116,866,00054,970,0002,277,376
6Sep 15, 2025 12:182,069,01417,207,884,53717,104,853,00067,967,0002,285,568
7Sep 15, 2025 12:182,070,02017,210,880,43617,113,194,00067,968,0002,289,664
8Sep 15, 2025 12:182,070,58217,218,072,77017,126,862,00058,971,0002,260,992
9Sep 15, 2025 12:182,072,97017,240,597,59217,145,683,00059,970,0002,519,040