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 9, 2026 15:11Victor MerckléVictor MerckléScore: 18,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 15:1216,611145,697,603136,853,0001,025,0002,117,632stderr
2Jul 9, 2026 15:1218,043157,679,954148,624,0001,137,0002,117,632stderr
3Jul 9, 2026 15:1218,085157,984,454149,011,0001,096,0002,117,632stderr
4Jul 9, 2026 15:1218,104158,107,767149,126,0001,145,0002,117,632stderr
5Jul 9, 2026 15:1218,182158,863,621149,828,0001,088,0002,117,632stderr
6Jul 9, 2026 15:1218,192158,946,254149,867,0001,128,0002,117,632stderr
7Jul 9, 2026 15:1218,216160,711,767150,179,0001,019,0002,117,632stderr
8Jul 9, 2026 15:1218,236160,910,098150,308,0001,057,0002,117,632stderr
9Jul 9, 2026 15:1218,237159,314,769150,258,0001,114,0002,117,632stderr