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 18:38Mikhail ShirokovMikhail ShirokovScore: 46,368Success
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 18:3846,361415,331,988382,795,0001,998,0002,449,408
2Jan 25, 2025 18:3846,364411,762,205382,823,0001,999,0002,531,328
3Jan 25, 2025 18:3846,365405,648,920382,830,0001,999,0002,531,328
4Jan 25, 2025 18:3846,365412,217,111382,832,0001,999,0002,531,328
5Jan 25, 2025 18:3846,368413,946,601382,859,0001,999,0002,449,408
6Jan 25, 2025 18:3846,375411,222,753382,914,0001,999,0002,531,328
7Jan 25, 2025 18:3846,382415,066,950382,975,0001,999,0002,531,328
8Jan 25, 2025 18:3846,383407,062,754382,983,0001,999,0002,449,408
9Jan 25, 2025 18:3846,385409,956,406382,997,0001,999,0002,531,328