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 2, 2026 10:36CheckHarryCheckHarryScore: 33,545Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 10:4633,467289,103,045276,776,0001,004,0002,113,536
2Sep 2, 2026 10:4633,507288,666,957277,105,0001,004,0002,113,536
3Sep 2, 2026 10:4633,530288,184,827277,296,0001,004,0002,113,536
4Sep 2, 2026 10:4633,533288,917,064277,325,0001,004,0002,113,536
5Sep 2, 2026 10:4633,545288,232,998277,428,0001,003,0002,113,536
6Sep 2, 2026 10:4633,547288,354,967277,439,0001,006,0002,113,536
7Sep 2, 2026 10:4633,578288,552,471277,697,0001,002,0002,113,536
8Sep 2, 2026 10:4633,610289,571,911277,963,0001,003,0002,113,536
9Sep 2, 2026 10:4633,617288,904,257278,025,0001,003,0002,113,536