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 7, 2026 17:44Kevin HeaveyKevin HeaveyScore: 9,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 17:449,68489,889,11379,228,0001,155,0002,117,632
2Jul 7, 2026 17:449,68890,027,65579,317,0001,099,0002,117,632
3Jul 7, 2026 17:449,69389,959,36279,353,0001,099,0002,117,632
4Jul 7, 2026 17:449,70590,088,59279,435,0001,120,0002,117,632
5Jul 7, 2026 17:449,72290,182,45479,692,0001,008,0002,117,632
6Jul 7, 2026 17:449,72390,357,25079,579,0001,122,0002,117,632
7Jul 7, 2026 17:449,78290,787,82780,070,0001,125,0002,117,632
8Jul 7, 2026 17:449,78890,772,88380,149,0001,096,0002,117,632
9Jul 7, 2026 17:449,81191,000,38980,268,0001,167,0002,121,728