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 listJul 6, 2025 11:36Valentin KofmanValentin KofmanScore: 5,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 11:365,96778,771,97048,517,0001,010,0002,289,664
2Jul 6, 2025 11:365,97178,197,95448,548,0001,011,0002,269,184
3Jul 6, 2025 11:365,97176,170,19648,551,0001,011,0002,265,088
4Jul 6, 2025 11:365,97774,633,71648,596,0001,012,0002,383,872
5Jul 6, 2025 11:365,97875,728,86549,618,00002,289,664
6Jul 6, 2025 11:365,97975,988,54449,624,00002,289,664
7Jul 6, 2025 11:365,98277,916,62149,652,00002,289,664
8Jul 6, 2025 11:365,98480,527,04348,657,0001,013,0002,289,664
9Jul 6, 2025 11:365,98578,776,54248,659,0001,013,0002,277,376
10Jul 6, 2025 11:367,12981,922,93158,169,0001,002,0002,265,088
11Jul 6, 2025 11:367,15685,843,69658,390,0001,006,0002,281,472
12Jul 6, 2025 11:367,20885,211,89459,824,00002,289,664