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 listSep 26, 2026 16:27Kevin HeaveyKevin HeaveyScore: 3,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 16:283,19638,022,04426,535,000020,480
2Sep 26, 2026 16:283,20137,931,56726,571,000020,480
3Sep 26, 2026 16:283,20737,750,58326,620,000020,480
4Sep 26, 2026 16:283,20937,653,60326,637,000020,480
5Sep 26, 2026 16:283,20935,381,92026,639,000020,480
6Sep 26, 2026 16:283,21636,636,08626,700,000020,480
7Sep 26, 2026 16:283,21836,623,20926,713,000020,480
8Sep 26, 2026 16:283,21937,760,48625,709,0001,009,00020,480
9Sep 26, 2026 16:283,23037,678,67726,816,000020,480