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 6, 2026 12:15Kevin HeaveyKevin HeaveyScore: 3,823Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 12:163,60239,749,76328,795,0001,107,0002,113,536
2Sep 6, 2026 12:163,62939,870,66529,026,0001,102,0002,113,536
3Sep 6, 2026 12:163,71740,716,68129,744,0001,108,0002,113,536
4Sep 6, 2026 12:163,81141,481,17630,528,0001,107,0002,113,536
5Sep 6, 2026 12:163,82341,636,65530,639,0001,099,0002,113,536
6Sep 6, 2026 12:163,82341,593,19730,624,0001,110,0002,113,536
7Sep 6, 2026 12:163,82541,732,19130,654,0001,097,0002,113,536
8Sep 6, 2026 12:163,83541,651,35130,746,0001,089,0002,113,536
9Sep 6, 2026 12:163,85641,896,92230,882,0001,124,0002,113,536