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 listNov 25, 2025 08:10Ham-HamHam-HamScore: 64,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2025 08:1064,680563,244,237535,842,000999,0002,289,664
2Nov 25, 2025 08:1064,685559,959,676534,886,0001,999,0002,269,184
3Nov 25, 2025 08:1064,698565,565,491534,994,0001,999,0002,289,664
4Nov 25, 2025 08:1064,710559,909,567535,089,0002,000,0002,289,664
5Nov 25, 2025 08:1064,718558,496,299537,163,00002,289,664
6Nov 25, 2025 08:1064,731563,590,128536,268,0001,000,0002,269,184
7Nov 25, 2025 08:1064,734565,850,637536,294,000998,0002,285,568
8Nov 25, 2025 08:1064,760563,050,311535,514,0001,998,0002,289,664
9Nov 25, 2025 08:1064,769567,473,324535,588,0001,998,0002,281,472