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:57Ham-HamHam-HamScore: 51,249Success
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:2751,183448,252,649422,824,0001,999,0002,273,280
2Nov 25, 2025 09:2751,198448,246,673423,944,000999,0002,494,464
3Nov 25, 2025 09:5751,214446,544,793424,077,0001,000,0002,490,368
4Nov 25, 2025 09:2751,233444,571,624424,236,0001,000,0002,494,464
5Nov 25, 2025 09:2751,239446,681,860424,282,0001,000,0002,531,328
6Nov 25, 2025 09:2751,247455,098,058424,352,000998,0002,502,656
7Nov 25, 2025 09:2751,249453,006,178424,367,0001,000,0002,494,464
8Nov 25, 2025 09:2751,290452,100,485423,709,0001,998,0002,535,424
9Nov 25, 2025 09:5751,296457,040,537423,762,0001,998,0002,273,280
10Nov 25, 2025 09:2751,312445,740,343423,894,0001,999,0002,527,232
11Nov 25, 2025 09:2751,362450,066,597425,308,0001,000,0002,498,560
12Nov 25, 2025 09:5751,620456,482,981427,448,0001,001,0002,490,368