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 25, 2025 15:20bendnbendnScore: 821,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 15:20821,2096,847,376,8806,811,039,0004,997,0002,510,848
2Jan 25, 2025 15:20821,6206,847,432,0846,813,450,0005,995,0002,293,760
3Jan 25, 2025 15:20823,6566,864,092,3206,832,344,0003,997,0002,510,848