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 15, 2026 18:44Daniel MastalerzDaniel MastalerzScore: 6,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 18:446,28974,150,82549,186,0003,011,0002,359,296
2Feb 15, 2026 18:446,29273,381,35949,212,0003,013,0002,314,240
3Feb 15, 2026 18:446,29677,214,04548,240,0004,020,0002,326,528
4Feb 15, 2026 18:446,38181,324,46848,966,0003,997,0002,318,336
5Feb 15, 2026 18:446,38975,608,51250,030,0003,001,0002,318,336
6Feb 15, 2026 18:446,40775,810,84250,165,0003,009,0002,514,944