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 listJun 24, 2025 22:53Valentin KofmanValentin KofmanScore: 12,453Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2025 22:539,436102,292,72676,312,0002,008,0002,289,664
2Jun 24, 2025 22:539,44499,053,70678,389,00002,285,568
3Jun 24, 2025 22:539,463104,032,32477,538,0001,006,0002,289,664
4Jun 24, 2025 22:5312,453125,566,012101,357,0002,007,0002,289,664
5Jun 24, 2025 22:5312,460129,375,651102,412,0001,004,0002,289,664
6Jun 24, 2025 22:5312,520127,836,853101,916,0001,998,0002,269,184