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 listDec 8, 2025 09:51warshipwarshipScore: 54,167Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 09:3054,066475,157,044447,751,000999,0002,285,568
2Dec 8, 2025 09:3054,119482,493,395448,190,0001,000,0002,285,568
3Dec 8, 2025 09:3054,136476,381,911448,326,0001,000,0002,277,376
4Dec 8, 2025 09:3054,148475,894,280447,434,0001,997,0002,260,992
5Dec 8, 2025 09:3054,156478,244,200447,498,0001,997,0002,285,568
6Dec 8, 2025 09:5154,165474,795,309447,570,0001,998,0002,371,584
7Dec 8, 2025 09:3054,167477,122,474448,585,000999,0002,285,568
8Dec 8, 2025 09:5154,168473,319,629448,599,000999,0002,359,296
9Dec 8, 2025 09:3054,178476,537,495448,677,000999,0002,523,136
10Dec 8, 2025 09:3054,199473,245,035448,855,000999,0002,260,992
11Dec 8, 2025 09:3054,223482,119,977448,047,0002,000,0002,265,088
12Dec 8, 2025 09:5154,330472,621,442448,938,0001,999,0002,269,184