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:09Daniel MastalerzDaniel MastalerzScore: 5,821Success
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:095,75976,322,58443,819,0003,983,0002,326,528
2Feb 19, 2026 22:095,76576,371,95743,863,0003,987,0002,519,040
3Feb 19, 2026 22:095,77573,955,51945,936,0001,997,0002,326,528
4Feb 19, 2026 22:095,82168,105,81044,289,0004,026,0002,322,432
5Feb 19, 2026 22:095,84271,280,24747,475,0001,010,0002,322,432
6Feb 19, 2026 22:095,84776,698,97046,508,0002,022,0002,506,752