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 10, 2026 07:13Victor MerckléVictor MerckléScore: 10,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 07:179,93691,258,68081,273,0001,202,0002,174,976
2Jun 10, 2026 07:1710,24694,012,53083,847,0001,200,0002,174,976
3Jun 10, 2026 07:1710,25297,806,33383,900,0001,194,0002,129,920
4Jun 10, 2026 07:1710,25794,109,01083,964,0001,171,0002,129,920
5Jun 10, 2026 07:1710,26494,189,05184,009,0001,187,0002,174,976
6Jun 10, 2026 07:1710,26694,138,68183,990,0001,220,0002,129,920
7Jun 10, 2026 07:1710,31294,489,18784,405,0001,186,0002,129,920
8Jun 10, 2026 07:1710,33697,623,81884,566,0001,226,0002,129,920
9Jun 10, 2026 07:1710,38295,071,49585,003,0001,169,0002,129,920