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 listOct 13, 2026 13:44highload-churnerhighload-churnerScore: 3,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 13:453,27036,026,09727,149,000020,480
2Oct 13, 2026 13:453,27836,024,87827,208,000020,480
3Oct 13, 2026 13:453,27936,163,54227,217,000020,480
4Oct 13, 2026 13:453,42137,860,39628,402,000020,480
5Oct 13, 2026 13:453,44337,404,00928,578,000020,480
6Oct 13, 2026 13:453,45837,631,53528,704,000020,480
7Oct 13, 2026 13:453,47338,352,75528,826,000020,480
8Oct 13, 2026 13:453,47338,257,81028,826,000020,480
9Oct 13, 2026 13:453,48038,469,68028,890,000020,480