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 listFeb 15, 2026 21:10Daniel MastalerzDaniel MastalerzScore: 7,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 21:107,30686,194,89957,607,0003,031,0002,326,528
2Feb 15, 2026 21:107,32983,902,68657,840,0002,991,0002,269,184
3Feb 15, 2026 21:107,33089,744,29457,851,0002,992,0002,265,088
4Feb 15, 2026 21:107,45486,236,14457,874,0003,991,0002,273,280
5Feb 15, 2026 21:107,45987,406,25657,913,0003,994,0002,310,144
6Feb 15, 2026 21:107,47083,762,76558,003,0004,000,0002,265,088