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 23:31Daniel MastalerzDaniel MastalerzScore: 5,819Success
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 23:325,72870,100,93144,511,0003,034,0002,273,280
2Feb 19, 2026 23:325,73974,386,58044,597,0003,040,0002,330,624
3Feb 19, 2026 23:315,74575,781,96945,655,0002,029,0002,375,680
4Feb 19, 2026 23:315,76874,475,97944,880,0002,992,0002,310,144
5Feb 19, 2026 23:315,78570,864,37544,012,0004,001,0002,306,048
6Feb 19, 2026 23:325,80876,226,97844,191,0004,017,0002,379,776
7Feb 19, 2026 23:325,81974,883,15344,273,0004,024,0002,260,992
8Feb 19, 2026 23:315,85175,072,94746,542,0002,023,0002,322,432
9Feb 19, 2026 23:315,85675,232,24847,589,0001,012,0002,301,952
10Feb 19, 2026 23:325,86683,743,13344,711,0003,974,0002,301,952
11Feb 19, 2026 23:325,87474,751,35544,772,0003,979,0002,523,136
12Feb 19, 2026 23:315,91472,022,87845,079,0004,007,0002,322,432