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 listOct 16, 2025 19:28BenzotoporBenzotoporScore: 50,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2025 19:2850,796454,499,041420,611,000999,0002,285,568
2Oct 16, 2025 19:2850,798450,775,060420,621,000999,0002,519,040
3Oct 16, 2025 19:2850,801446,872,720419,647,0001,998,0002,277,376
4Oct 16, 2025 19:2850,801450,433,364419,654,0001,998,0002,285,568
5Oct 16, 2025 19:2850,803445,664,518419,670,0001,998,0002,285,568
6Oct 16, 2025 19:2850,805445,029,612419,687,0001,998,0002,260,992
7Oct 16, 2025 19:2850,808449,373,173420,705,000999,0002,273,280
8Oct 16, 2025 19:2850,808447,467,799420,707,000999,0002,527,232
9Oct 16, 2025 19:2850,817445,652,428420,780,000999,0002,277,376