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 18, 2026 17:36Daniel MastalerzDaniel MastalerzScore: 6,389Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 17:366,27976,106,08948,107,0004,008,0002,310,144
2Feb 18, 2026 17:366,27980,266,38849,108,0003,006,0002,527,232
3Feb 18, 2026 17:366,28579,759,27050,160,0002,006,0002,273,280
4Feb 18, 2026 17:366,38976,396,20450,024,0003,001,0002,310,144
5Feb 18, 2026 17:366,38976,430,72150,028,0003,001,0002,269,184
6Feb 18, 2026 17:366,39975,442,64250,108,0003,006,0002,265,088