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 02:51CheckHarryCheckHarryScore: 4,109Success
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 02:514,08343,708,95032,882,0001,008,0002,113,536
2Sep 6, 2026 02:514,09243,873,31332,957,0001,011,0002,113,536
3Sep 6, 2026 02:514,09743,889,25433,001,0001,009,0002,113,536
4Sep 6, 2026 02:514,10044,011,18833,003,0001,030,0002,113,536
5Sep 6, 2026 02:514,10944,080,49133,077,0001,035,0002,113,536
6Sep 6, 2026 02:514,11352,692,62633,092,0001,053,0002,113,536
7Sep 6, 2026 02:514,11444,079,39133,032,0001,119,0002,113,536
8Sep 6, 2026 02:514,24245,118,67334,194,0001,017,0002,113,536
9Sep 6, 2026 02:514,28154,200,37034,485,0001,052,0002,113,536