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 07:18CheckHarryCheckHarryScore: 4,940Success
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 07:194,81649,879,44938,954,0001,026,0002,113,536
2Sep 3, 2026 07:194,82949,824,70339,056,0001,025,0002,113,536
3Sep 3, 2026 07:194,89350,382,54239,592,0001,025,0002,113,536
4Sep 3, 2026 07:194,92950,788,17338,912,0002,001,0002,113,536
5Sep 3, 2026 07:194,94050,813,31238,998,0002,005,0002,113,536
6Sep 3, 2026 07:194,95650,982,44239,134,0002,007,0002,113,536
7Sep 3, 2026 07:194,98551,219,54439,373,0002,010,0002,113,536
8Sep 3, 2026 07:194,98552,790,44339,369,0002,012,0002,113,536
9Sep 3, 2026 07:194,99251,333,23339,422,0002,013,0002,113,536