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 03:40CheckHarryCheckHarryScore: 3,964Success
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 03:403,88342,146,68431,221,0001,009,0002,113,536
2Sep 6, 2026 03:403,89042,260,44731,267,0001,027,0002,113,536
3Sep 6, 2026 03:403,89242,140,94431,295,0001,010,0002,113,536
4Sep 6, 2026 03:403,89342,250,22631,305,0001,011,0002,113,536
5Sep 6, 2026 03:403,96442,814,16831,893,0001,011,0002,113,536
6Sep 6, 2026 03:404,00744,322,22832,113,0001,151,0002,113,536
7Sep 6, 2026 03:404,02143,278,37132,357,0001,021,0002,113,536
8Sep 6, 2026 03:404,02443,364,16032,392,0001,013,0002,113,536
9Sep 6, 2026 03:404,06251,383,00632,637,0001,081,0002,113,536