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 19, 2026 22:08Daniel MastalerzDaniel MastalerzScore: 6,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 22:086,01777,979,13046,947,0002,996,0002,273,280
2Feb 19, 2026 22:086,07077,390,79647,359,0003,022,0002,293,760
3Feb 19, 2026 22:086,07473,514,37546,380,0004,033,0002,277,376
4Feb 19, 2026 22:086,14372,124,41647,991,0002,999,0002,310,144
5Feb 19, 2026 22:086,14579,113,79148,001,0003,000,0002,322,432
6Feb 19, 2026 22:086,20980,729,13848,502,0003,031,0002,273,280