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 8, 2026 20:09Victor MerckléVictor MerckléScore: 4,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 20:104,50845,480,33536,352,0001,066,0002,113,536
2Jun 8, 2026 20:104,51645,173,08436,415,0001,069,0002,113,536
3Jun 8, 2026 20:104,52745,920,96236,509,0001,067,0002,113,536
4Jun 8, 2026 20:104,52845,275,88336,520,0001,070,0002,113,536
5Jun 8, 2026 20:104,53945,721,30736,618,0001,059,0002,113,536
6Jun 8, 2026 20:104,53945,350,79736,668,0001,009,0002,113,536
7Jun 8, 2026 20:104,55945,507,94336,841,0001,004,0002,113,536
8Jun 8, 2026 20:104,69947,068,35738,000,0001,005,0002,113,536
9Jun 8, 2026 20:104,75347,094,49038,395,0001,055,0002,113,536