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 7, 2026 04:47Victor MerckléVictor MerckléScore: 5,591Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:07wn10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 04:495,58254,464,47245,172,0001,163,0002,117,632stderr
2Jul 7, 2026 04:495,58254,472,89545,203,0001,132,0002,117,632stderr
3Jul 7, 2026 04:495,58754,492,81645,223,0001,153,0002,117,632stderr
4Jul 7, 2026 04:495,59054,459,51345,236,0001,162,0002,117,632stderr
5Jul 7, 2026 04:495,59154,451,46945,246,0001,160,0002,117,632stderr
6Jul 7, 2026 04:495,59354,520,13145,271,0001,153,0002,117,632stderr
7Jul 7, 2026 04:495,59554,510,65945,439,0001,007,0002,117,632stderr
8Jul 7, 2026 04:495,59754,616,63245,457,0001,006,0002,117,632stderr
9Jul 7, 2026 04:495,61254,803,04345,442,0001,144,0002,117,632stderr