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 8, 2026 15:22Victor MerckléVictor MerckléScore: 13,239Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 15:2412,803114,335,487105,139,0001,128,0002,117,632stderr
2Jul 8, 2026 15:2412,892115,120,092105,869,0001,139,0002,117,632stderr
3Jul 8, 2026 15:2413,150117,032,085108,036,0001,111,0002,117,632stderr
4Jul 8, 2026 15:2413,226117,841,421108,640,0001,139,0002,117,632stderr
5Jul 8, 2026 15:2413,239118,024,795108,817,0001,070,0002,117,632stderr
6Jul 8, 2026 15:2413,259118,158,816109,045,0001,011,0002,117,632stderr
7Jul 8, 2026 15:2413,260117,914,203108,963,0001,101,0002,117,632stderr
8Jul 8, 2026 15:2413,413119,402,913110,250,0001,082,0002,117,632stderr
9Jul 8, 2026 15:2413,414119,481,973110,259,0001,085,0002,117,632stderr