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, 2026 21:25Victor MerckléVictor MerckléScore: 5,620Success
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, 2026 21:265,61454,738,17445,476,0001,126,0002,117,632stderr
2Jul 6, 2026 21:265,61554,632,09145,480,0001,128,0002,117,632stderr
3Jul 6, 2026 21:265,61754,688,60045,612,0001,011,0002,117,632stderr
4Jul 6, 2026 21:265,61754,440,74845,507,0001,117,0002,117,632stderr
5Jul 6, 2026 21:265,62055,194,75445,541,0001,109,0002,117,632stderr
6Jul 6, 2026 21:265,62754,758,36145,678,0001,030,0002,117,632stderr
7Jul 6, 2026 21:265,63554,883,71545,726,0001,048,0002,117,632stderr
8Jul 6, 2026 21:265,63654,637,63645,755,0001,027,0002,117,632stderr
9Jul 6, 2026 21:265,64054,822,27445,798,0001,016,0002,117,632stderr