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 16, 2026 01:31Victor MerckléVictor MerckléScore: 6,958Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 01:316,95064,817,74957,689,00002,113,536
2May 16, 2026 01:316,95766,107,24156,713,0001,032,0002,113,536
3May 16, 2026 01:316,95765,091,84656,728,0001,023,0002,113,536
4May 16, 2026 01:316,95866,916,86556,749,0001,005,0002,113,536
5May 16, 2026 01:316,95867,040,57856,730,0001,022,0002,113,536
6May 16, 2026 01:317,00865,545,98657,153,0001,016,0002,113,536
7May 16, 2026 01:317,03767,448,70557,315,0001,099,0002,113,536
8May 16, 2026 01:317,08066,016,46458,771,00002,113,536
9May 16, 2026 01:317,09568,448,42657,879,0001,016,0002,113,536