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 listMay 24, 2026 11:20Victor MerckléVictor MerckléScore: 6,260Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 11:216,24159,620,27350,752,0001,055,0002,113,536
2May 24, 2026 11:216,24559,641,09550,774,0001,060,0002,113,536
3May 24, 2026 11:216,25259,700,25550,824,0001,074,0002,113,536
4May 24, 2026 11:216,25459,648,77650,850,0001,059,0002,113,536
5May 24, 2026 11:216,26059,745,77750,897,0001,062,0002,113,536
6May 24, 2026 11:216,26960,551,26451,001,0001,035,0002,113,536
7May 24, 2026 11:216,27259,974,66550,998,0001,063,0002,113,536
8May 24, 2026 11:216,35760,533,88051,702,0001,067,0002,113,536
9May 24, 2026 11:216,50961,849,25352,988,0001,040,0002,113,536