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 21, 2026 12:07Daniel MastalerzDaniel MastalerzScore: 6,380Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 12:076,28577,550,06147,151,0005,016,0002,330,624
2Feb 21, 2026 12:076,28675,286,54749,167,0003,010,0002,334,720
3Feb 21, 2026 12:076,29573,137,92447,222,0005,023,0002,334,720
4Feb 21, 2026 12:076,38074,580,97048,961,0003,996,0002,260,992
5Feb 21, 2026 12:076,39074,034,33050,033,0003,002,0002,326,528
6Feb 21, 2026 12:076,50277,972,77750,966,0002,998,0002,326,528