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:10Daniel MastalerzDaniel MastalerzScore: 5,762Success
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:105,73173,845,55444,531,0003,036,0002,326,528
2Feb 19, 2026 22:105,73382,298,64944,550,0003,037,0002,310,144
3Feb 19, 2026 22:105,76177,318,92244,830,0002,988,0002,326,528
4Feb 19, 2026 22:105,76176,581,40943,832,0003,984,0002,265,088
5Feb 19, 2026 22:105,76278,844,78244,837,0002,989,0002,326,528
6Feb 19, 2026 22:105,76274,408,58044,833,0002,988,0002,523,136
7Feb 19, 2026 22:105,76274,378,63243,843,0003,985,0002,330,624
8Feb 19, 2026 22:105,76473,622,92243,857,0003,987,0002,289,664
9Feb 19, 2026 22:105,76870,907,20544,883,0002,992,0002,330,624
10Feb 19, 2026 22:105,81671,628,77644,249,0004,022,0002,322,432
11Feb 19, 2026 22:105,86681,452,08845,647,0003,043,0002,277,376
12Feb 19, 2026 22:105,94470,009,77745,306,0004,027,0002,314,240