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 12:50wnwnScore: 3,306Success
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 12:533,28735,753,54426,243,0001,041,0002,113,536
2Sep 5, 2026 12:533,29635,602,67726,349,0001,008,0002,113,536
3Sep 5, 2026 12:533,30035,839,90226,386,0001,011,0002,113,536
4Sep 5, 2026 12:533,30635,787,55126,410,0001,033,0002,113,536
5Sep 5, 2026 12:533,30636,001,01626,420,0001,028,0002,113,536
6Sep 5, 2026 12:533,31435,954,02626,467,0001,046,0002,113,536
7Sep 5, 2026 12:533,46737,242,79827,770,0001,009,0002,113,536
8Sep 5, 2026 12:533,47838,559,90627,861,0001,008,0002,113,536
9Sep 5, 2026 12:533,47838,065,77627,834,0001,034,0002,113,536