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 7, 2026 19:06Victor MerckléVictor MerckléScore: 4,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 19:084,65546,470,95837,560,0001,083,0002,113,536
2Jun 7, 2026 19:084,69146,598,16237,910,0001,030,0002,113,536
3Jun 7, 2026 19:084,85848,016,47439,266,0001,059,0002,113,536
4Jun 7, 2026 19:084,87548,106,01639,429,0001,041,0002,113,536
5Jun 7, 2026 19:084,87847,993,15839,484,0001,008,0002,113,536
6Jun 7, 2026 19:084,87848,158,44239,419,0001,070,0002,113,536
7Jun 7, 2026 19:084,87948,206,32039,427,0001,069,0002,113,536
8Jun 7, 2026 19:084,88548,162,58939,521,0001,028,0002,113,536
9Jun 7, 2026 19:084,90248,157,38239,677,0001,015,0002,113,536