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 listSep 18, 2025 13:39sheryllynn24sheryllynn24Score: 15,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 18, 2025 13:3915,749164,265,956128,723,0001,995,0002,510,848
2Sep 18, 2025 13:3915,750157,307,519128,727,0001,995,0002,523,136
3Sep 18, 2025 13:3915,751161,346,334129,733,000997,0002,510,848
4Sep 18, 2025 13:3915,760159,211,026128,810,0001,997,0002,510,848
5Sep 18, 2025 13:3915,770157,020,358127,896,0002,997,0002,506,752
6Sep 18, 2025 13:3915,782157,100,497128,991,0001,999,0002,506,752
7Sep 18, 2025 13:3915,785158,118,609128,014,0003,000,0002,277,376
8Sep 18, 2025 13:3915,793161,469,081129,080,0002,001,0002,519,040
9Sep 18, 2025 13:3915,865157,823,627129,683,0001,995,0002,273,280