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 06:49highload-churnerhighload-churnerScore: 3,366Success
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 06:503,28436,087,65927,261,000020,480
2Oct 13, 2026 06:503,29640,247,66227,365,000020,480
3Oct 13, 2026 06:503,29636,215,84227,365,000020,480
4Oct 13, 2026 06:503,30836,279,92826,440,0001,018,00020,480
5Oct 13, 2026 06:503,36636,799,28027,944,000020,480
6Oct 13, 2026 06:503,39937,077,08128,219,000020,480
7Oct 13, 2026 06:503,46938,199,76928,797,000020,480
8Oct 13, 2026 06:503,48238,346,40228,902,000020,480
9Oct 13, 2026 06:503,49737,988,00329,032,000020,480