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:05CheckHarryCheckHarryScore: 3,890Success
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:073,88342,077,71231,227,0001,010,0002,113,536
2Sep 6, 2026 03:073,88642,142,34831,232,0001,023,0002,113,536
3Sep 6, 2026 03:073,88942,130,38031,270,0001,009,0002,113,536
4Sep 6, 2026 03:073,88942,111,93831,272,0001,010,0002,113,536
5Sep 6, 2026 03:073,89042,206,65631,279,0001,013,0002,113,536
6Sep 6, 2026 03:073,89442,326,46631,285,0001,043,0002,113,536
7Sep 6, 2026 03:073,89642,223,15831,335,0001,010,0002,113,536
8Sep 6, 2026 03:073,90242,726,31131,282,0001,108,0002,113,536
9Sep 6, 2026 03:074,03143,361,27632,449,0001,016,0002,113,536