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:14Ham-HamHam-HamScore: 62,237Success
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:1462,192536,218,306516,197,00002,273,280
2Nov 25, 2025 08:1462,230545,360,493514,514,0001,998,0002,396,160
3Nov 25, 2025 08:1462,234540,166,988514,541,0001,998,0002,490,368
4Nov 25, 2025 08:1462,236549,199,600515,561,000999,0002,273,280
5Nov 25, 2025 08:1462,237547,173,446514,572,0001,998,0002,404,352
6Nov 25, 2025 08:1462,246544,721,963514,642,0001,998,0002,519,040
7Nov 25, 2025 08:1462,250542,035,045515,675,000999,0002,273,280
8Nov 25, 2025 08:1462,264543,116,377515,790,000999,0002,490,368
9Nov 25, 2025 08:1462,277540,274,144515,904,000999,0002,273,280