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 14, 2026 11:14highload-churnerhighload-churnerScore: 3,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2026 11:143,24635,922,32026,949,000020,480
2Oct 14, 2026 11:143,24836,513,21826,960,000020,480
3Oct 14, 2026 11:143,24935,998,66326,974,000020,480
4Oct 14, 2026 11:143,25436,624,82727,010,000020,480
5Oct 14, 2026 11:143,25636,025,32827,028,000020,480
6Oct 14, 2026 11:143,25635,996,66727,033,000020,480
7Oct 14, 2026 11:143,26236,022,88927,079,000020,480
8Oct 14, 2026 11:143,26838,638,54627,132,000020,480
9Oct 14, 2026 11:143,27036,173,02127,142,000020,480