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 1, 2026 20:11Victor MerckléVictor MerckléScore: 4,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 20:124,13942,083,01933,276,0001,080,0002,117,632stderr
2Jul 1, 2026 20:124,15142,184,67833,292,0001,162,0002,117,632stderr
3Jul 1, 2026 20:124,15642,193,65333,388,0001,115,0002,117,632stderr
4Jul 1, 2026 20:124,16142,232,58733,504,0001,036,0002,117,632stderr
5Jul 1, 2026 20:124,17042,412,39333,575,0001,043,0002,117,632stderr
6Jul 1, 2026 20:124,18542,574,78133,694,0001,048,0002,117,632stderr
7Jul 1, 2026 20:124,18642,500,46033,704,0001,042,0002,117,632stderr
8Jul 1, 2026 20:124,19342,495,39433,682,0001,125,0002,117,632stderr
9Jul 1, 2026 20:124,39744,316,69335,455,0001,045,0002,117,632stderr