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 13, 2026 21:11Daniel MastalerzDaniel MastalerzScore: 6,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 21:116,79979,145,14452,403,0004,031,0002,306,048
2Feb 13, 2026 21:116,80585,010,42755,477,0001,008,0002,326,528
3Feb 13, 2026 21:116,80779,144,82651,450,0005,044,0002,273,280
4Feb 13, 2026 21:116,80884,566,36253,481,0003,027,0002,523,136
5Feb 13, 2026 21:116,80882,263,24953,482,0003,027,0002,265,088
6Feb 13, 2026 21:116,81186,990,25055,526,0001,009,0002,310,144
7Feb 13, 2026 21:116,82290,215,57954,600,0002,022,0002,310,144
8Feb 13, 2026 21:116,82383,750,07552,583,0004,044,0002,326,528
9Feb 13, 2026 21:116,83885,060,01350,779,0005,974,0002,322,432
10Feb 13, 2026 21:116,95986,073,48155,767,0001,991,0002,265,088
11Feb 13, 2026 21:116,96484,516,94351,825,0005,979,0002,265,088
12Feb 13, 2026 21:116,97479,729,33255,890,0001,996,0002,265,088