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 17:44Victor MerckléVictor MerckléScore: 24,507Success
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 17:4623,829206,290,178191,805,0005,977,00024,576stderr
2Sep 7, 2026 17:4623,904206,898,886191,677,0006,727,0002,117,632stderr
3Sep 7, 2026 17:4624,003207,883,495192,241,0006,989,0002,117,632stderr
4Sep 7, 2026 17:4624,183210,039,192194,227,0006,495,00024,576stderr
5Sep 7, 2026 17:4624,507211,970,427195,563,0007,849,0002,117,632stderr
6Sep 7, 2026 17:4624,555213,094,855197,754,0006,057,00024,576stderr
7Sep 7, 2026 17:4624,609212,811,322197,492,0006,770,00024,576stderr
8Sep 7, 2026 17:4624,692213,408,659198,665,0006,285,00024,576stderr
9Sep 7, 2026 17:4624,709213,697,271197,702,0007,389,0002,117,632stderr