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 10, 2026 07:31Victor MerckléVictor MerckléScore: 4,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 07:344,89349,547,23039,436,0001,183,0002,129,920
2Jun 10, 2026 07:344,90049,673,48439,489,0001,189,0002,129,920
3Jun 10, 2026 07:344,91049,729,71739,547,0001,210,0002,129,920
4Jun 10, 2026 07:344,91149,739,58439,554,0001,210,0002,129,920
5Jun 10, 2026 07:344,91149,696,25239,565,0001,198,0002,129,920
6Jun 10, 2026 07:344,91449,724,23139,572,0001,217,0002,129,920
7Jun 10, 2026 07:344,91649,773,73939,622,0001,189,0002,174,976
8Jun 10, 2026 07:344,93649,968,64739,789,0001,180,0002,129,920
9Jun 10, 2026 07:344,99850,528,42440,292,0001,197,0002,129,920