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 5, 2025 09:49scompa18scompa18Score: 90,095Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2025 09:4990,082775,068,057745,681,0001,999,0002,277,376
2Jan 5, 2025 09:4990,095772,864,828745,793,0001,999,0002,277,376
3Jan 5, 2025 09:4990,135777,397,738746,124,0002,000,0002,277,376