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:00CheckHarryCheckHarryScore: 3,901Success
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:013,88242,194,29131,212,0001,010,0002,113,536
2Sep 6, 2026 03:013,88642,197,77431,242,0001,016,0002,113,536
3Sep 6, 2026 03:013,89242,129,68931,294,0001,016,0002,113,536
4Sep 6, 2026 03:013,89442,180,26031,303,0001,018,0002,113,536
5Sep 6, 2026 03:013,90142,267,61931,374,0001,010,0002,113,536
6Sep 6, 2026 03:013,92942,526,73431,584,0001,027,0002,113,536
7Sep 6, 2026 03:013,98142,961,83132,018,0001,025,0002,113,536
8Sep 6, 2026 03:014,01943,202,40132,334,0001,030,0002,113,536
9Sep 6, 2026 03:014,08043,791,65932,863,0001,009,0002,113,536