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 15, 2026 20:28e1011e1011Score: 58,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 20:2958,213494,520,631426,682,00056,487,00020,480
2Oct 15, 2026 20:2958,223493,922,009427,754,00055,504,00020,480
3Oct 15, 2026 20:2958,241494,228,763427,928,00055,477,00020,480
4Oct 15, 2026 20:2958,279494,405,609427,254,00056,469,00020,480
5Oct 15, 2026 20:2958,308495,177,204427,335,00056,627,00020,480
6Oct 15, 2026 20:2958,327494,997,991427,608,00056,511,00020,480
7Oct 15, 2026 20:2958,341494,901,960427,639,00056,592,00020,480
8Oct 15, 2026 20:2958,354495,080,820427,768,00056,573,00020,480
9Oct 15, 2026 20:2958,390495,969,885427,137,00057,508,00020,480