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:07CheckHarryCheckHarryScore: 4,008Success
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:083,94242,514,12831,705,0001,014,0002,113,536
2Sep 6, 2026 03:083,96542,710,95131,906,0001,009,0002,113,536
3Sep 6, 2026 03:083,97842,882,41632,015,0001,009,0002,113,536
4Sep 6, 2026 03:083,99543,127,14132,151,0001,009,0002,113,536
5Sep 6, 2026 03:084,00843,110,48432,262,0001,009,0002,113,536
6Sep 6, 2026 03:084,01043,352,89532,070,0001,213,0002,113,536
7Sep 6, 2026 03:084,03043,376,92432,447,0001,009,0002,113,536
8Sep 6, 2026 03:084,07843,722,58832,838,0001,012,0002,113,536
9Sep 6, 2026 03:084,17544,553,68733,649,0001,009,0002,113,536