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:17Ham-HamHam-HamScore: 62,236Success
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:1762,207547,088,471515,314,0001,000,0002,273,280
2Nov 25, 2025 08:1762,211542,705,729515,348,0001,000,0002,273,280
3Nov 25, 2025 08:1762,211546,022,587516,348,00002,519,040
4Nov 25, 2025 08:1762,225545,099,256515,470,000998,0002,392,064
5Nov 25, 2025 08:1762,236542,274,366514,558,0001,998,0002,404,352
6Nov 25, 2025 08:1762,237545,956,542515,568,000999,0002,273,280
7Nov 25, 2025 08:1762,252542,460,667514,697,0001,998,0002,273,280
8Nov 25, 2025 08:1762,258548,692,402514,742,0001,998,0002,510,848
9Nov 25, 2025 08:1762,266537,741,986514,806,0001,999,0002,404,352