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 listJul 19, 2026 01:39e1011e1011Score: 2,039,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 01:412,037,96616,925,711,56116,847,078,00068,040,0002,113,536
2Jul 19, 2026 01:412,038,46216,929,278,56816,855,204,00064,036,0002,113,536
3Jul 19, 2026 01:412,039,25216,936,265,82716,859,752,00066,042,0002,113,536
4Jul 19, 2026 01:412,039,47516,938,187,38616,862,607,00065,041,0002,113,536
5Jul 19, 2026 01:412,039,53016,938,658,75316,863,065,00065,039,0002,113,536
6Jul 19, 2026 01:412,039,94316,941,632,01816,866,426,00065,106,0002,113,536
7Jul 19, 2026 01:412,040,65716,948,737,19216,870,270,00067,187,0002,113,536
8Jul 19, 2026 01:412,047,22117,001,921,92416,923,735,00068,204,0002,113,536
9Jul 19, 2026 01:412,068,03417,174,717,78917,099,605,00065,083,0002,113,536