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:27CheckHarryCheckHarryScore: 4,776Success
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:284,75849,383,46738,268,0001,230,0002,113,536
2Sep 6, 2026 02:284,76449,306,06638,311,0001,234,0002,113,536
3Sep 6, 2026 02:284,76949,432,79638,354,0001,230,0002,113,536
4Sep 6, 2026 02:284,77449,476,48838,405,0001,221,0002,113,536
5Sep 6, 2026 02:284,77649,536,84838,402,0001,243,0002,113,536
6Sep 6, 2026 02:284,78049,567,76938,447,0001,228,0002,113,536
7Sep 6, 2026 02:284,78749,922,71938,496,0001,244,0002,113,536
8Sep 6, 2026 02:284,83249,947,30138,870,0001,236,0002,113,536
9Sep 6, 2026 02:284,91050,543,42439,537,0001,223,0002,113,536