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 listJul 21, 2026 08:46Kevin HeaveyKevin HeaveyScore: 3,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 08:483,60939,513,16728,905,0001,054,0002,113,536
2Jul 21, 2026 08:483,61639,647,55528,981,0001,037,0002,113,536
3Jul 21, 2026 08:483,62839,790,74229,066,0001,051,0002,113,536
4Jul 21, 2026 08:483,62839,752,91029,068,0001,052,0002,113,536
5Jul 21, 2026 08:483,62839,687,59129,065,0001,052,0002,113,536
6Jul 21, 2026 08:483,62942,181,38029,070,0001,052,0002,113,536
7Jul 21, 2026 08:483,64639,810,77429,210,0001,056,0002,113,536
8Jul 21, 2026 08:483,66240,035,46529,343,0001,054,0002,113,536
9Jul 21, 2026 08:483,68440,284,81129,531,0001,051,0002,113,536