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 14, 2026 06:59Victor MerckléVictor MerckléScore: 6,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 06:596,96367,890,81357,801,00002,113,536
2May 14, 2026 06:596,96567,091,68556,769,0001,046,0002,113,536
3May 14, 2026 06:596,96668,140,80256,775,0001,044,0002,113,536
4May 14, 2026 06:596,96765,103,69756,800,0001,027,0002,113,536
5May 14, 2026 06:596,96867,232,81157,838,00002,113,536
6May 14, 2026 06:596,96967,198,53957,848,00002,113,536
7May 14, 2026 06:596,97167,146,94056,851,0001,009,0002,113,536
8May 14, 2026 06:596,98767,426,94756,888,0001,110,0002,113,536
9May 14, 2026 06:597,07165,971,81157,684,0001,007,0002,113,536