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 25, 2026 12:15Victor MerckléVictor MerckléScore: 4,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 12:164,21742,591,93633,919,0001,090,0002,113,536
2Jun 25, 2026 12:164,22742,583,23533,992,0001,100,0002,113,536
3Jun 25, 2026 12:164,23542,700,96734,073,0001,079,0002,113,536
4Jun 25, 2026 12:164,24342,833,03234,140,0001,080,0002,113,536
5Jun 25, 2026 12:164,24442,893,29634,115,0001,117,0002,113,536
6Jun 25, 2026 12:164,25142,831,60634,224,0001,067,0002,113,536
7Jun 25, 2026 12:164,26842,983,27934,357,0001,075,0002,113,536
8Jun 25, 2026 12:164,27543,098,94634,399,0001,089,0002,113,536
9Jun 25, 2026 12:164,29443,228,97134,571,0001,074,0002,113,536