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 5, 2026 20:15Victor MerckléVictor MerckléScore: 5,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:155,92357,080,31448,092,0001,071,0002,117,632stderr
2Jul 5, 2026 20:155,93457,084,28148,160,0001,099,0002,117,632stderr
3Jul 5, 2026 20:155,93757,153,48748,155,0001,125,0002,117,632stderr
4Jul 5, 2026 20:155,94257,887,55048,193,0001,129,0002,117,632stderr
5Jul 5, 2026 20:155,94257,868,46248,189,0001,130,0002,117,632stderr
6Jul 5, 2026 20:155,94657,838,80348,246,0001,112,0002,117,632stderr
7Jul 5, 2026 20:155,95457,536,97848,323,0001,103,0002,117,632stderr
8Jul 5, 2026 20:155,95557,716,38648,295,0001,136,0002,117,632stderr
9Jul 5, 2026 20:155,96058,010,26248,346,0001,130,0002,117,632stderr