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 11:33Victor MerckléVictor MerckléScore: 7,868Success
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 11:347,72071,758,80262,955,0001,122,0002,117,632stderr
2Jun 25, 2026 11:347,72671,795,49763,016,0001,113,0002,117,632stderr
3Jun 25, 2026 11:347,72771,800,68063,023,0001,116,0002,117,632stderr
4Jun 25, 2026 11:347,80173,356,39163,723,0001,030,0002,117,632stderr
5Jun 25, 2026 11:347,86873,006,45364,188,0001,120,0002,117,632stderr
6Jun 25, 2026 11:347,89673,396,14464,413,0001,128,0002,117,632stderr
7Jun 25, 2026 11:347,90673,287,81764,484,0001,139,0002,117,632stderr
8Jun 25, 2026 11:347,92074,680,50564,621,0001,122,0002,117,632stderr
9Jun 25, 2026 11:348,00674,470,93165,365,0001,088,0002,117,632stderr