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 28, 2026 19:33boop34boop34Score: 9,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2026 19:349,65190,150,92173,912,0006,194,00020,480
2Jul 28, 2026 19:349,88292,041,85175,824,0006,200,0002,117,632
3Jul 28, 2026 19:349,89892,029,10076,609,0005,549,00020,480
4Jul 28, 2026 19:349,94992,703,63175,598,0006,979,00020,480
5Jul 28, 2026 19:349,96693,342,46273,336,0009,387,00014,700,544
6Jul 28, 2026 19:3410,04593,331,37376,519,0006,861,00020,480
7Jul 28, 2026 19:3410,20394,650,50673,571,00011,114,00010,506,240
8Jul 28, 2026 19:3410,40996,314,71376,888,0009,508,0004,214,784
9Jul 28, 2026 19:3411,420104,700,04175,996,00018,797,00050,352,128