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 08:25highload-churnerhighload-churnerScore: 3,326Success
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 08:253,30736,354,74727,451,000020,480
2Oct 14, 2026 08:253,31336,471,70527,506,000020,480
3Oct 14, 2026 08:253,31636,767,50527,529,000020,480
4Oct 14, 2026 08:253,32236,541,73927,577,000020,480
5Oct 14, 2026 08:253,32636,614,83926,584,0001,022,00020,480
6Oct 14, 2026 08:253,32637,167,46327,614,000020,480
7Oct 14, 2026 08:253,32737,510,02727,620,000020,480
8Oct 14, 2026 08:253,33337,166,97527,664,000020,480
9Oct 14, 2026 08:253,34337,326,06227,747,000020,480