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 26, 2026 06:46Victor MerckléVictor MerckléScore: 7,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 06:477,30968,357,17759,542,0001,123,0002,113,536
2Jun 26, 2026 06:477,31168,420,20959,523,0001,162,0002,113,536
3Jun 26, 2026 06:477,31768,438,25459,602,0001,132,0002,113,536
4Jun 26, 2026 06:477,35868,758,21860,032,0001,047,0002,113,536
5Jun 26, 2026 06:477,36468,615,75460,049,0001,080,0002,113,536
6Jun 26, 2026 06:477,41069,221,31660,439,0001,071,0002,113,536
7Jun 26, 2026 06:477,41271,862,37160,497,0001,027,0002,113,536
8Jun 26, 2026 06:477,43869,248,21660,597,0001,144,0002,113,536
9Jun 26, 2026 06:477,60270,880,18162,012,0001,087,0002,113,536