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 06:36Andrey NikolaevAndrey NikolaevScore: 64,239Success
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 06:3664,059560,054,329474,722,00056,966,0002,281,472
2Aug 18, 2025 06:3664,168558,095,119467,641,00064,950,0002,469,888
3Aug 18, 2025 06:3664,171557,712,150472,665,00059,957,0002,285,568
4Aug 18, 2025 06:3664,180557,411,383484,723,00047,972,0002,367,488
5Aug 18, 2025 06:3664,239556,065,083471,164,00062,021,0002,367,488
6Aug 18, 2025 06:3664,264558,565,736487,358,00046,033,0002,285,568
7Aug 18, 2025 06:3664,291561,341,224470,659,00062,954,0002,285,568
8Aug 18, 2025 06:3664,293561,500,905466,677,00066,953,0002,285,568
9Aug 18, 2025 06:3664,373556,861,714489,268,00045,024,0002,375,680