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 27, 2026 04:13mkmkScore: 84,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2026 04:1383,966707,448,559633,881,00063,042,0002,113,536
2Sep 27, 2026 04:1383,998707,664,687633,861,00063,330,0002,113,536
3Sep 27, 2026 04:1384,014707,863,418634,287,00063,035,0002,113,536
4Sep 27, 2026 04:1384,019708,041,623634,254,00063,111,0002,113,536
5Sep 27, 2026 04:1384,019709,451,528634,319,00063,046,0002,113,536
6Sep 27, 2026 04:1384,027707,979,806634,160,00063,270,0002,113,536
7Sep 27, 2026 04:1384,038708,671,288634,152,00063,368,0002,113,536
8Sep 27, 2026 04:1384,068708,368,247634,590,00063,175,0002,113,536
9Sep 27, 2026 04:1384,147708,959,817635,268,00063,157,0002,113,536