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:34Ham-HamHam-HamScore: 62,242Success
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:3462,197537,555,517516,235,00002,392,064
2Nov 25, 2025 08:3462,223541,299,235515,451,0001,000,0002,396,160
3Nov 25, 2025 08:3462,236543,387,770515,557,000999,0002,400,256
4Nov 25, 2025 08:3462,237547,233,515514,569,0001,998,0002,400,256
5Nov 25, 2025 08:3462,242543,585,549514,612,0001,998,0002,404,352
6Nov 25, 2025 08:3462,250548,701,757514,673,0001,998,0002,273,280
7Nov 25, 2025 08:3462,251539,132,841514,686,0001,998,0002,273,280
8Nov 25, 2025 08:3462,251548,287,500514,688,0001,998,0002,273,280
9Nov 25, 2025 08:3462,258543,738,690515,746,000999,0002,400,256