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 listMay 25, 2026 16:52Kenzie_RTKenzie_RTScore: 124,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 16:52123,2841,035,719,6061,022,161,0001,104,0002,113,536
2May 25, 2026 16:52123,5711,035,291,5941,024,511,0001,129,0002,113,536
3May 25, 2026 16:52124,3531,043,156,8561,030,969,0001,169,0002,113,536
4May 25, 2026 16:52124,3661,044,642,5761,031,148,0001,093,0002,113,536
5May 25, 2026 16:52124,3671,044,780,8121,031,125,0001,128,0002,113,536
6May 25, 2026 16:52124,3701,043,320,4951,031,125,0001,148,0002,113,536
7May 25, 2026 16:52124,3711,042,626,0171,031,150,0001,134,0002,113,536
8May 25, 2026 16:52124,3711,042,261,8161,031,158,0001,127,0002,113,536
9May 25, 2026 16:52124,3751,041,948,3971,031,179,0001,141,0002,113,536