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:59CheckHarryCheckHarryScore: 4,013Success
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:004,00143,090,70632,195,0001,019,0002,113,536
2Sep 6, 2026 03:004,01043,199,82232,094,0001,195,0002,113,536
3Sep 6, 2026 03:004,01243,155,74632,292,0001,009,0002,113,536
4Sep 6, 2026 03:004,01343,130,56532,293,0001,017,0002,113,536
5Sep 6, 2026 03:004,01343,174,39132,300,0001,010,0002,113,536
6Sep 6, 2026 03:004,02343,281,30332,375,0001,018,0002,113,536
7Sep 6, 2026 03:004,11244,012,56333,121,0001,013,0002,113,536
8Sep 6, 2026 03:004,20644,730,44933,896,0001,022,0002,117,632
9Sep 6, 2026 03:004,30358,246,36434,615,0001,108,0002,117,632