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 listJan 11, 2025 07:09Ian MckibbenIan MckibbenScore: 79,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 07:0978,996678,450,565655,668,00002,293,760
2Jan 11, 2025 07:0979,072680,599,122654,303,0001,997,0002,277,376
3Jan 11, 2025 07:0979,104678,348,173654,569,0001,998,0002,293,760