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:16Ham-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:1662,194537,674,528515,214,0001,000,0002,273,280
2Nov 25, 2025 08:1662,200538,216,105515,261,0001,000,0002,273,280
3Nov 25, 2025 08:1662,222547,052,305515,441,000998,0002,273,280
4Nov 25, 2025 08:1662,224543,080,719515,465,000998,0002,404,352
5Nov 25, 2025 08:1662,237542,597,345514,566,0001,998,0002,396,160
6Nov 25, 2025 08:1662,237549,116,410514,569,0001,998,0002,273,280
7Nov 25, 2025 08:1662,238546,229,310514,574,0001,998,0002,400,256
8Nov 25, 2025 08:1662,245542,478,999514,633,0001,998,0002,273,280
9Nov 25, 2025 08:1662,249548,515,520514,670,0001,998,0002,400,256