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 15, 2026 13:20Victor MerckléVictor MerckléScore: 6,971Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 13:206,96266,054,80457,787,00002,113,536
2May 15, 2026 13:206,96265,177,86557,789,00002,113,536
3May 15, 2026 13:206,96566,486,29357,811,00002,113,536
4May 15, 2026 13:206,96766,994,29257,828,00002,113,536
5May 15, 2026 13:206,97167,156,60256,846,0001,016,0002,113,536
6May 15, 2026 13:207,01468,477,15057,175,0001,046,0002,113,536
7May 15, 2026 13:207,08268,553,40757,750,0001,035,0002,113,536
8May 15, 2026 13:207,09666,280,49658,900,00002,113,536
9May 15, 2026 13:207,12971,287,41858,170,0001,007,0002,113,536