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 30, 2026 15:35CodeReclaimersCodeReclaimersScore: 19,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 15:3518,274162,434,329150,430,0001,248,0002,113,536
2Jul 30, 2026 15:3519,767174,105,803162,886,0001,186,0002,113,536
3Jul 30, 2026 15:3519,776174,360,321163,133,0001,009,0002,113,536
4Jul 30, 2026 15:3519,777174,213,468162,992,0001,163,0002,113,536
5Jul 30, 2026 15:3519,795174,355,797163,047,0001,256,0002,113,536
6Jul 30, 2026 15:3519,799174,360,502163,098,0001,237,0002,113,536
7Jul 30, 2026 15:3519,813175,227,480163,215,0001,236,0002,113,536
8Jul 30, 2026 15:3519,813174,468,979163,276,0001,176,0002,113,536
9Jul 30, 2026 15:3520,005177,618,485164,851,0001,194,0002,113,536