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 listJun 19, 2026 21:28Victor MerckléVictor MerckléScore: 30,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 21:2929,998256,666,420247,879,0001,109,0002,113,536
2Jun 19, 2026 21:2930,005256,669,717248,048,0001,000,0002,113,536
3Jun 19, 2026 21:2930,010256,798,208247,924,0001,165,0002,113,536
4Jun 19, 2026 21:2930,482260,642,117251,924,0001,080,0002,113,536
5Jun 19, 2026 21:2930,497260,792,853252,048,0001,078,0002,113,536
6Jun 19, 2026 21:2930,508260,876,927252,193,0001,027,0002,113,536
7Jun 19, 2026 21:2930,513260,941,525252,200,0001,060,0002,113,536
8Jun 19, 2026 21:2930,542261,136,341252,478,0001,023,0002,113,536
9Jun 19, 2026 21:2930,555261,280,730252,578,0001,035,0002,113,536