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 20, 2026 16:22Daniel MastalerzDaniel MastalerzScore: 5,842Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 16:225,76174,666,23244,829,0002,988,0002,306,048
2Feb 20, 2026 16:225,79470,722,53044,087,0004,007,0002,306,048
3Feb 20, 2026 16:225,80171,402,32644,136,0004,012,0002,326,528
4Feb 20, 2026 16:225,84272,817,64246,467,0002,020,0002,310,144
5Feb 20, 2026 16:225,85674,211,97146,580,0002,025,0002,306,048
6Feb 20, 2026 16:225,87179,284,19245,749,0002,983,0002,260,992