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:40CheckHarryCheckHarryScore: 3,847Success
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:423,83841,623,07030,844,0001,013,0002,113,536
2Sep 6, 2026 03:423,84041,744,74530,868,0001,009,0002,113,536
3Sep 6, 2026 03:423,84141,728,55330,872,0001,015,0002,113,536
4Sep 6, 2026 03:423,84441,864,87330,898,0001,009,0002,113,536
5Sep 6, 2026 03:423,84741,806,09430,919,0001,012,0002,113,536
6Sep 6, 2026 03:423,86341,981,58931,054,0001,015,0002,113,536
7Sep 6, 2026 03:423,90342,199,55531,376,0001,026,0002,113,536
8Sep 6, 2026 03:423,91842,466,06231,390,0001,134,0002,113,536
9Sep 6, 2026 03:423,96742,806,75831,911,0001,019,0002,113,536