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 02:46highload-churnerhighload-churnerScore: 3,470Success
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 02:473,28336,055,72127,249,000020,480
2Oct 13, 2026 02:473,30536,263,71627,439,000020,480
3Oct 13, 2026 02:473,30536,464,52827,433,000020,480
4Oct 13, 2026 02:473,32636,475,92427,613,000020,480
5Oct 13, 2026 02:473,47037,588,16128,809,000020,480
6Oct 13, 2026 02:473,48338,372,68528,915,000020,480
7Oct 13, 2026 02:473,48638,363,24528,935,000020,480
8Oct 13, 2026 02:473,49338,449,98028,995,000020,480
9Oct 13, 2026 02:473,49338,488,02228,993,000020,480