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 listSep 7, 2026 20:14Victor MerckléVictor MerckléScore: 25,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 20:1625,423220,247,714190,342,00020,670,00028,672stderr
2Sep 7, 2026 20:1625,547222,005,440192,364,00019,679,00028,672stderr
3Sep 7, 2026 20:1625,556220,743,398191,657,00020,462,00028,672stderr
4Sep 7, 2026 20:1625,637221,364,661191,297,00021,492,00028,672stderr
5Sep 7, 2026 20:1625,657221,604,142192,177,00020,783,00028,672stderr
6Sep 7, 2026 20:1625,683221,789,895192,344,00020,827,00028,672stderr
7Sep 7, 2026 20:1625,703222,002,253192,160,00021,182,00028,672stderr
8Sep 7, 2026 20:1625,798222,748,201191,939,00022,185,00028,672stderr
9Sep 7, 2026 20:1625,895223,538,181191,924,00023,006,00028,672stderr