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 listJun 19, 2026 07:12Victor MerckléVictor MerckléScore: 4,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 07:134,50946,141,63236,428,0001,003,0002,113,536
2Jun 19, 2026 07:134,53144,989,54736,569,0001,039,0002,113,536
3Jun 19, 2026 07:134,70746,694,93038,007,0001,063,0002,113,536
4Jun 19, 2026 07:134,71046,742,84438,030,0001,071,0002,113,536
5Jun 19, 2026 07:134,71246,718,66538,046,0001,066,0002,113,536
6Jun 19, 2026 07:134,72246,796,37538,172,0001,023,0002,113,536
7Jun 19, 2026 07:134,72646,810,51638,170,0001,060,0002,113,536
8Jun 19, 2026 07:134,73046,885,57938,187,0001,080,0002,113,536
9Jun 19, 2026 07:134,73146,886,14638,263,0001,009,0002,113,536