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 23, 2026 15:13Victor MerckléVictor MerckléScore: 4,561Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 15:144,51544,929,66136,408,0001,073,0002,113,536
2Jun 23, 2026 15:144,53145,125,14336,526,0001,082,0002,113,536
3Jun 23, 2026 15:144,53445,182,14236,551,0001,089,0002,113,536
4Jun 23, 2026 15:144,53845,139,31636,589,0001,081,0002,113,536
5Jun 23, 2026 15:144,56145,365,27436,772,0001,089,0002,113,536
6Jun 23, 2026 15:144,57745,800,58136,901,0001,094,0002,113,536
7Jun 23, 2026 15:144,74746,866,34438,303,0001,102,0002,113,536
8Jun 23, 2026 15:144,91648,288,28939,790,0001,019,0002,113,536
9Jun 23, 2026 15:144,97148,717,02540,245,0001,015,0002,113,536