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 17, 2026 03:37Kevin HeaveyKevin HeaveyScore: 3,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 03:383,68240,324,03129,405,0001,161,0002,117,632
2Jul 17, 2026 03:383,69240,458,95229,385,0001,266,0002,117,632
3Jul 17, 2026 03:383,69440,333,32329,484,0001,182,0002,117,632
4Jul 17, 2026 03:383,76141,176,53529,986,0001,238,0002,117,632
5Jul 17, 2026 03:383,76140,964,37630,178,0001,041,0002,117,632
6Jul 17, 2026 03:383,76940,997,01230,046,0001,239,0002,117,632
7Jul 17, 2026 03:383,77941,083,93730,318,0001,048,0002,117,632
8Jul 17, 2026 03:383,79041,267,71030,418,0001,039,0002,117,632
9Jul 17, 2026 03:383,79741,245,86730,480,0001,036,0002,117,632