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 26, 2026 10:24Victor MerckléVictor MerckléScore: 8,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 10:258,98482,316,87873,439,0001,130,0002,113,536
2Jun 26, 2026 10:258,98682,312,24373,498,0001,091,0002,113,536
3Jun 26, 2026 10:258,98782,272,03873,507,0001,087,0002,113,536
4Jun 26, 2026 10:258,98882,678,56673,524,0001,084,0002,113,536
5Jun 26, 2026 10:258,99283,545,48473,539,0001,098,0002,113,536
6Jun 26, 2026 10:259,05782,901,92774,174,0001,002,0002,113,536
7Jun 26, 2026 10:259,14583,641,20874,819,0001,087,0002,113,536
8Jun 26, 2026 10:259,16883,779,50674,997,0001,100,0002,113,536
9Jun 26, 2026 10:259,24084,371,47275,679,0001,021,0002,113,536