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:08CheckHarryCheckHarryScore: 3,848Success
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:093,82641,739,64430,749,0001,010,0002,113,536
2Sep 6, 2026 03:093,83041,629,10630,781,0001,010,0002,113,536
3Sep 6, 2026 03:093,83241,702,96830,796,0001,012,0002,113,536
4Sep 6, 2026 03:093,83941,737,40530,845,0001,019,0002,113,536
5Sep 6, 2026 03:093,84842,057,50230,938,0001,008,0002,113,536
6Sep 6, 2026 03:093,90242,186,10631,380,0001,012,0002,113,536
7Sep 6, 2026 03:093,94042,531,38131,695,0001,009,0002,113,536
8Sep 6, 2026 03:093,97742,872,48031,878,0001,138,0002,113,536
9Sep 6, 2026 03:094,00843,182,36432,224,0001,045,0002,113,536