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 listFeb 9, 2026 20:26Daniel MastalerzDaniel MastalerzScore: 10,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2026 20:269,920109,855,69079,327,0003,012,0002,523,136
2Feb 9, 2026 20:269,926105,186,34280,374,0002,009,0002,314,240
3Feb 9, 2026 20:2610,007103,259,84281,060,0002,001,0002,265,088
4Feb 9, 2026 20:2610,026108,162,61181,211,0002,005,0002,519,040
5Feb 9, 2026 20:2610,030110,160,32780,238,0003,008,0002,519,040
6Feb 9, 2026 20:2610,058112,736,34282,474,0001,005,0002,293,760