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 21:25Daniel MastalerzDaniel MastalerzScore: 5,817Success
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 21:255,78974,367,09844,047,0004,004,0002,265,088
2Feb 19, 2026 21:255,79576,495,19344,089,0004,008,0002,326,528
3Feb 19, 2026 21:255,80573,342,42044,164,0004,014,0002,306,048
4Feb 19, 2026 21:255,81272,326,73344,218,0004,019,0002,523,136
5Feb 19, 2026 21:255,81372,790,30244,225,0004,020,0002,326,528
6Feb 19, 2026 21:255,81670,581,62244,248,0004,022,0002,326,528
7Feb 19, 2026 21:255,81775,140,96445,268,0003,017,0002,310,144
8Feb 19, 2026 21:255,82571,052,51145,326,0003,021,0002,326,528
9Feb 19, 2026 21:255,88675,752,65644,863,0003,987,0002,289,664
10Feb 19, 2026 21:255,90473,639,87345,006,0004,000,0002,260,992
11Feb 19, 2026 21:255,92973,959,45646,201,0003,013,0002,285,568
12Feb 19, 2026 21:255,94573,027,53546,323,0003,021,0002,326,528