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 21, 2026 18:26Daniel MastalerzDaniel MastalerzScore: 5,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 18:265,50275,075,47443,636,0002,029,0002,314,240
2Feb 21, 2026 18:265,56969,129,22342,201,0004,019,0002,514,944
3Feb 21, 2026 18:265,60169,363,75243,458,0003,031,0002,260,992
4Feb 21, 2026 18:265,61172,003,57643,531,0003,037,0002,260,992
5Feb 21, 2026 18:265,62072,475,31143,604,0003,042,0002,260,992
6Feb 21, 2026 18:265,64474,686,72842,860,0003,987,0002,326,528