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:14CheckHarryCheckHarryScore: 3,845Success
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:163,82941,506,68130,775,0001,009,0002,113,536
2Sep 6, 2026 03:163,83241,696,70530,789,0001,018,0002,113,536
3Sep 6, 2026 03:163,83841,712,79030,834,0001,024,0002,113,536
4Sep 6, 2026 03:163,84341,753,10230,895,0001,009,0002,113,536
5Sep 6, 2026 03:163,84541,842,25030,908,0001,010,0002,113,536
6Sep 6, 2026 03:163,86041,976,10330,832,0001,208,0002,113,536
7Sep 6, 2026 03:163,86042,093,37130,976,0001,069,0002,113,536
8Sep 6, 2026 03:163,87241,964,76531,134,0001,010,0002,113,536
9Sep 6, 2026 03:163,96242,794,09831,868,0001,017,0002,113,536