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 listAug 23, 2026 18:02Victor MerckléVictor MerckléScore: 3,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 18:043,76439,601,49830,119,0001,130,0002,117,632stderr
2Aug 23, 2026 18:043,77539,706,75530,201,0001,137,0002,117,632stderr
3Aug 23, 2026 18:043,78539,828,90330,293,0001,123,0002,117,632stderr
4Aug 23, 2026 18:043,79239,858,97630,396,0001,078,0002,117,632stderr
5Aug 23, 2026 18:043,80640,001,78130,579,0001,015,0002,117,632stderr
6Aug 23, 2026 18:043,81240,148,46030,462,0001,179,0002,117,632stderr
7Aug 23, 2026 18:043,82640,246,31430,687,0001,077,0002,117,632stderr
8Aug 23, 2026 18:043,82740,062,42230,680,0001,090,0002,117,632stderr
9Aug 23, 2026 18:043,85440,401,15330,897,0001,099,0002,117,632stderr