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 23, 2026 08:45Kevin HeaveyKevin HeaveyScore: 3,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 08:543,21835,605,21825,597,0001,119,0002,113,536
2Sep 23, 2026 08:543,22135,377,11625,558,0001,182,0002,113,536
3Sep 23, 2026 08:543,22335,659,10825,600,0001,153,0002,113,536
4Sep 23, 2026 08:543,23135,749,28025,805,0001,017,0002,113,536
5Sep 23, 2026 08:543,23336,223,11325,804,0001,036,0002,113,536
6Sep 23, 2026 08:543,24436,526,55525,824,0001,103,0002,113,536
7Sep 23, 2026 08:543,24836,538,21225,754,0001,208,0002,113,536
8Sep 23, 2026 08:543,25935,893,08025,952,0001,104,0002,113,536
9Sep 23, 2026 08:543,26436,736,25725,991,0001,104,0002,113,536