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 09:58Ham-HamHam-HamScore: 51,279Success
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 09:5751,178445,791,184422,783,0001,998,0002,531,328
2Nov 25, 2025 09:5851,211450,165,670424,049,0001,000,0002,527,232
3Nov 25, 2025 09:5751,217451,975,681424,105,0001,000,0002,273,280
4Nov 25, 2025 09:5851,237456,440,214424,270,0001,000,0002,273,280
5Nov 25, 2025 09:5851,276450,398,749424,592,000999,0002,535,424
6Nov 25, 2025 09:5851,277451,184,770423,605,0001,998,0002,494,464
7Nov 25, 2025 09:5851,279459,169,160424,615,000999,0002,273,280
8Nov 25, 2025 09:5851,293445,792,528423,736,0001,998,0002,498,560
9Nov 25, 2025 09:5851,317452,767,504423,933,0001,999,0002,494,464
10Nov 25, 2025 09:5851,322451,507,468423,973,0001,999,0002,273,280
11Nov 25, 2025 09:5751,327450,017,717425,017,0001,000,0002,490,368
12Nov 25, 2025 09:5851,665455,707,745426,823,0001,999,0002,494,464