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 listAug 26, 2025 06:25Ashish AhujaAshish AhujaScore: 11,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2025 05:3011,102118,606,05076,296,00015,853,0002,482,176
2Aug 26, 2025 05:3011,146115,363,84971,623,00020,890,0002,506,752
3Aug 26, 2025 05:3011,205125,206,04871,000,00022,000,0002,351,104
4Aug 26, 2025 05:3011,251121,825,81275,503,00017,882,0002,355,200
5Aug 26, 2025 06:2511,527128,590,12778,733,00016,942,0002,265,088
6Aug 26, 2025 06:2511,588121,036,23376,349,00019,830,0002,506,752
7Aug 26, 2025 05:3011,637125,711,02776,670,00019,914,0002,338,816
8Aug 26, 2025 06:2511,706120,226,99383,278,00013,879,0002,506,752
9Aug 26, 2025 05:3011,709122,285,14678,345,00018,842,0002,412,544
10Aug 26, 2025 06:2511,774121,643,31979,776,00017,949,0002,510,848
11Aug 26, 2025 06:2511,898132,434,08477,805,00020,947,0002,502,656
12Aug 26, 2025 06:2511,948127,633,14981,321,00017,850,0002,506,752