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 listAug 21, 2025 19:35Adam FolwarcznyAdam FolwarcznyScore: 61,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2025 19:3554,427479,906,238450,747,000999,0002,527,232
2Aug 21, 2025 19:3659,845523,402,944494,719,0001,998,0002,527,232
3Aug 21, 2025 19:3660,514531,372,231501,269,000998,0002,527,232
4Aug 21, 2025 19:3561,950536,259,904513,182,0001,000,0002,527,232
5Aug 21, 2025 19:3663,679553,434,118528,536,00002,424,832
6Aug 21, 2025 19:3564,277555,136,514532,496,000999,0002,527,232