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 02:51CheckHarryCheckHarryScore: 4,212Success
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 02:544,19644,822,00033,812,0001,021,0002,113,536
2Sep 6, 2026 02:544,20444,806,87333,894,0001,007,0002,113,536
3Sep 6, 2026 02:544,20644,797,79933,904,0001,007,0002,113,536
4Sep 6, 2026 02:544,21244,812,11633,939,0001,023,0002,113,536
5Sep 6, 2026 02:544,21244,852,20833,952,0001,008,0002,113,536
6Sep 6, 2026 02:544,21744,946,88333,988,0001,020,0002,113,536
7Sep 6, 2026 02:544,27345,353,05934,428,0001,042,0002,113,536
8Sep 6, 2026 02:544,39046,277,33335,430,0001,008,0002,113,536
9Sep 6, 2026 02:544,45046,770,16435,758,0001,185,0002,113,536