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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 18:478,93181,858,50973,068,0001,062,0002,113,536
2Jun 7, 2026 18:478,93881,998,24773,110,0001,077,0002,113,536
3Jun 7, 2026 18:478,94882,012,32273,193,0001,082,0002,113,536
4Jun 7, 2026 18:478,96283,143,04573,298,0001,089,0002,113,536
5Jun 7, 2026 18:479,22084,212,75475,458,0001,073,0002,113,536
6Jun 7, 2026 18:479,22984,293,73275,545,0001,061,0002,113,536
7Jun 7, 2026 18:479,26184,574,95675,804,0001,070,0002,113,536
8Jun 7, 2026 18:479,27884,861,71875,996,0001,012,0002,113,536
9Jun 7, 2026 18:479,29984,811,41376,143,0001,040,0002,113,536