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 13, 2026 19:47Victor MerckléVictor MerckléScore: 7,904Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 19:487,89574,267,95765,532,00002,113,536
2May 13, 2026 19:487,89672,980,54764,494,0001,046,0002,113,536
3May 13, 2026 19:487,89972,913,37164,553,0001,013,0002,113,536
4May 13, 2026 19:487,90375,941,20264,593,0001,006,0002,113,536
5May 13, 2026 19:487,90475,949,41664,558,0001,046,0002,113,536
6May 13, 2026 19:487,90573,350,69864,605,0001,008,0002,113,536
7May 13, 2026 19:487,91174,100,87664,662,0001,000,0002,113,536
8May 13, 2026 19:487,92273,026,05964,719,0001,039,0002,113,536
9May 13, 2026 19:487,92474,110,91064,772,0001,005,0002,113,536