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 24, 2026 19:29Daniel MastalerzDaniel MastalerzScore: 6,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 19:296,18671,868,97747,319,0004,027,0002,314,240
2Feb 24, 2026 19:296,19175,535,76847,358,0004,030,0002,265,088
3Feb 24, 2026 19:296,22184,867,77948,597,0003,037,0002,322,432
4Feb 24, 2026 19:296,24675,501,02748,789,0003,049,0002,310,144
5Feb 24, 2026 19:296,25575,747,47248,920,0002,995,0002,260,992
6Feb 24, 2026 19:296,28276,410,57648,132,0004,011,0002,260,992