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 21, 2026 22:19Kevin HeaveyKevin HeaveyScore: 3,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 22:213,94142,484,81930,615,0002,096,0002,121,728
2Jul 21, 2026 22:213,94542,253,27830,682,0002,068,0002,117,632
3Jul 21, 2026 22:213,94642,364,74030,646,0002,109,0002,117,632
4Jul 21, 2026 22:213,95742,368,02130,664,0002,186,0002,117,632
5Jul 21, 2026 22:213,96442,560,38230,788,0002,118,0002,117,632
6Jul 21, 2026 22:213,96442,537,83530,775,0002,133,0002,121,728
7Jul 21, 2026 22:213,96842,639,12630,675,0002,265,0002,117,632
8Jul 21, 2026 22:213,97042,538,79530,865,0002,086,0002,117,632
9Jul 21, 2026 22:213,97443,288,94030,872,0002,119,0002,117,632