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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 19:4796,440807,945,334794,519,0005,941,0002,121,728stderr
2May 15, 2026 19:4796,597809,982,881795,053,0006,710,0002,121,728stderr
3May 15, 2026 19:4796,693812,793,489796,002,0006,555,0002,121,728stderr
4May 15, 2026 19:4797,132813,490,258800,125,0006,074,0002,121,728stderr
5May 15, 2026 19:4797,299815,860,872801,789,0005,800,0002,121,728stderr
6May 15, 2026 19:4797,448818,235,095802,619,0006,204,0002,121,728stderr
7May 15, 2026 19:4797,648821,077,080803,445,0007,038,0002,121,728stderr
8May 15, 2026 19:4797,778820,947,978805,672,0005,893,0002,121,728stderr
9May 15, 2026 19:4797,947821,404,836806,815,0006,153,0002,121,728stderr