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 listMay 17, 2026 13:42Victor MerckléVictor MerckléScore: 7,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 13:467,39570,193,98360,291,0001,092,0002,113,536
2May 17, 2026 13:467,39668,643,55560,308,0001,082,0002,113,536
3May 17, 2026 13:467,40069,047,68460,394,0001,030,0002,113,536
4May 17, 2026 13:467,40368,787,96160,376,0001,077,0002,113,536
5May 17, 2026 13:467,40568,746,41360,389,0001,080,0002,113,536
6May 17, 2026 13:467,40669,538,37960,440,0001,031,0002,113,536
7May 17, 2026 13:467,41170,526,74960,446,0001,073,0002,113,536
8May 17, 2026 13:467,43670,804,37360,563,0001,160,0002,113,536
9May 17, 2026 13:467,44369,121,04560,712,0001,070,0002,113,536