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 listJan 31, 2025 22:53PolycarbohydratePolycarbohydrateScore: 387,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2025 22:53387,0533,238,884,7813,151,564,00060,972,0002,281,472
2Jan 31, 2025 22:53387,3663,239,564,3043,168,162,00046,972,0002,281,472
3Jan 31, 2025 22:53387,3873,240,343,9713,150,349,00064,965,0002,289,664
4Jan 31, 2025 22:53387,6003,244,422,2873,158,114,00058,964,0002,289,664
5Jan 31, 2025 22:53387,8183,245,203,6063,143,936,00074,950,0002,281,472
6Jan 31, 2025 22:53390,2543,262,689,0663,188,141,00050,970,0002,285,568
7Jan 31, 2025 22:53390,3563,272,016,0533,176,994,00062,960,0002,359,296
8Jan 31, 2025 22:53390,5913,269,897,1053,173,949,00067,956,0002,363,392
9Jan 31, 2025 22:53390,5983,276,794,5103,178,002,00063,959,0002,285,568