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 18, 2025 12:54Ashish AhujaAshish AhujaScore: 10,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 12:5410,800118,522,51785,656,0003,984,0002,473,984
2Aug 18, 2025 12:5410,822118,642,55682,840,0006,986,0002,383,872
3Aug 18, 2025 12:5410,825119,635,41983,860,0005,990,0002,273,280
4Aug 18, 2025 12:5410,916114,942,14283,637,0006,969,0002,289,664
5Aug 18, 2025 12:5410,938117,005,98282,805,0007,981,0002,273,280
6Aug 18, 2025 12:5410,960114,436,18583,970,0006,997,0002,273,280
7Aug 18, 2025 12:5410,975118,652,28086,089,0005,005,0002,535,424
8Aug 18, 2025 12:5411,005113,538,18586,321,0005,018,0002,502,656
9Aug 18, 2025 12:5411,021115,583,33283,520,0007,954,0002,535,424
10Aug 18, 2025 12:5411,025115,869,55683,549,0007,957,0002,383,872
11Aug 18, 2025 12:5411,028118,602,36585,567,0005,969,0002,523,136
12Aug 18, 2025 12:5411,223116,440,41087,138,0006,009,0002,527,232