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 3, 2026 04:20CheckHarryCheckHarryScore: 12,200Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 04:2012,149110,787,70499,804,0001,037,0002,113,536
2Sep 3, 2026 04:2012,160110,787,96299,866,0001,069,0002,113,536
3Sep 3, 2026 04:2012,166110,782,40599,933,0001,045,0002,113,536
4Sep 3, 2026 04:2012,181111,008,666100,072,0001,036,0002,113,536
5Sep 3, 2026 04:2012,200111,158,321100,173,0001,092,0002,113,536
6Sep 3, 2026 04:2012,220111,258,859100,396,0001,034,0002,113,536
7Sep 3, 2026 04:2012,227111,351,476100,437,0001,048,0002,113,536
8Sep 3, 2026 04:2012,237111,399,822100,527,0001,041,0002,113,536
9Sep 3, 2026 04:2012,240111,521,452100,556,0001,041,0002,113,536