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 listJul 24, 2025 17:19Leon ZhaoLeon ZhaoScore: 89,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2025 17:1989,332773,299,256740,459,000999,0002,260,992
2Jul 24, 2025 17:1989,349775,829,927739,601,0001,998,0002,256,896
3Jul 24, 2025 17:1989,376770,955,156740,819,000999,0002,260,992
4Jul 24, 2025 17:1989,383769,556,090740,884,000999,0002,519,040
5Jul 24, 2025 17:1989,430770,500,673742,272,00002,260,992
6Jul 24, 2025 17:1989,435771,495,117741,313,0001,000,0002,260,992
7Jul 24, 2025 17:1989,463766,639,885740,544,0001,998,0002,387,968
8Jul 24, 2025 17:1989,731773,869,314742,766,0001,999,0002,519,040
9Jul 24, 2025 17:1989,784770,804,632744,207,0001,000,0002,383,872