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 10, 2026 07:20Victor MerckléVictor MerckléScore: 4,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 07:244,88549,368,63839,371,0001,176,0002,129,920
2Jun 10, 2026 07:244,88849,509,16939,376,0001,196,0002,129,920
3Jun 10, 2026 07:244,89649,698,93439,432,0001,206,0002,129,920
4Jun 10, 2026 07:244,90249,672,23639,509,0001,183,0002,129,920
5Jun 10, 2026 07:244,91049,740,17739,591,0001,170,0002,129,920
6Jun 10, 2026 07:244,91449,781,94339,593,0001,197,0002,129,920
7Jun 10, 2026 07:244,92649,915,42539,703,0001,188,0002,129,920
8Jun 10, 2026 07:244,92949,916,59339,725,0001,186,0002,129,920
9Jun 10, 2026 07:244,95050,127,38039,887,0001,203,0002,129,920