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 15, 2024 20:45Elnur RakhmatullinElnur RakhmatullinScore: 49,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 20:4549,314432,415,278407,303,0002,001,0002,277,376
2Oct 15, 2024 20:4549,315437,754,964408,312,0001,000,0002,277,376
3Oct 15, 2024 20:4549,320434,998,354408,357,0001,000,0002,277,376
4Oct 15, 2024 20:4549,326436,047,925407,401,0002,001,0002,277,376
5Oct 15, 2024 20:4549,351440,823,824408,614,000999,0002,277,376
6Oct 15, 2024 20:4549,351440,913,902408,612,000999,0002,277,376
7Oct 15, 2024 20:4549,352433,963,540407,620,0001,998,0002,269,184
8Oct 15, 2024 20:4549,352436,973,256408,624,000999,0002,273,280
9Oct 15, 2024 20:4549,357438,352,671409,661,00002,273,280