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 25, 2026 21:29Victor MerckléVictor MerckléScore: 4,190Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 21:314,16242,109,57733,461,0001,090,0002,113,536
2Jun 25, 2026 21:314,16942,364,62733,582,0001,027,0002,113,536
3Jun 25, 2026 21:314,17942,266,85233,587,0001,099,0002,113,536
4Jun 25, 2026 21:314,18943,805,96233,742,0001,029,0002,113,536
5Jun 25, 2026 21:314,19042,253,90133,738,0001,039,0002,113,536
6Jun 25, 2026 21:314,19842,313,68533,758,0001,087,0002,113,536
7Jun 25, 2026 21:314,21242,426,77133,824,0001,138,0002,113,536
8Jun 25, 2026 21:314,30343,268,85334,617,0001,100,0002,113,536
9Jun 25, 2026 21:314,30443,525,06534,620,0001,110,0002,113,536