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 07:52CheckHarryCheckHarryScore: 3,868Success
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 07:533,80341,338,44830,552,0001,015,0002,113,536
2Sep 6, 2026 07:533,80441,504,07430,541,0001,037,0002,113,536
3Sep 6, 2026 07:533,80541,440,19430,579,0001,009,0002,113,536
4Sep 6, 2026 07:533,81741,618,76330,675,0001,012,0002,113,536
5Sep 6, 2026 07:533,86841,972,59831,098,0001,013,0002,113,536
6Sep 6, 2026 07:533,89442,261,27531,306,0001,015,0002,113,536
7Sep 6, 2026 07:533,90342,438,25331,384,0001,011,0002,113,536
8Sep 6, 2026 07:533,91342,383,63631,468,0001,010,0002,113,536
9Sep 6, 2026 07:533,93142,547,24231,619,0001,012,0002,113,536