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 19, 2026 12:04Victor MerckléVictor MerckléScore: 6,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 12:066,15861,053,39550,119,0001,000,0002,113,536
2May 19, 2026 12:066,16560,382,39850,143,0001,029,0002,113,536
3May 19, 2026 12:066,18959,291,28050,341,0001,032,0002,113,536
4May 19, 2026 12:066,22560,602,52550,660,0001,008,0002,113,536
5May 19, 2026 12:066,23560,359,92150,721,0001,037,0002,113,536
6May 19, 2026 12:066,29261,671,08951,214,0001,013,0002,113,536
7May 19, 2026 12:066,34860,507,93651,689,0001,004,0002,113,536
8May 19, 2026 12:066,36460,717,29451,810,0001,018,0002,113,536
9May 19, 2026 12:066,37060,744,74151,841,0001,037,0002,113,536