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 4, 2025 06:34thatmagicalcatthatmagicalcatScore: 56,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2025 06:3456,060494,095,390464,301,0001,000,0002,351,104
2Jun 4, 2025 06:3456,096490,564,319463,599,0001,998,0002,285,568
3Jun 4, 2025 06:3456,100494,526,334463,630,0001,998,0002,363,392
4Jun 4, 2025 06:3456,102492,546,938463,646,0001,998,0002,359,296
5Jun 4, 2025 06:3456,105497,080,961464,670,000999,0002,277,376
6Jun 4, 2025 06:3456,122494,905,400464,815,000999,0002,359,296
7Jun 4, 2025 06:3456,145493,721,102465,001,0001,000,0002,285,568
8Jun 4, 2025 06:3456,167491,628,598466,182,00002,351,104
9Jun 4, 2025 06:3456,180488,771,666465,293,0001,000,0002,285,568