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 22, 2025 08:38infiKNIGHTeinfiKNIGHTeScore: 333,112Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 08:38332,5912,799,732,4502,691,544,00068,962,0002,273,280
2Jun 22, 2025 08:38333,0492,790,218,5632,691,326,00072,981,0002,273,280
3Jun 22, 2025 08:38333,0602,787,386,7912,711,426,00052,969,0002,375,680
4Jun 22, 2025 08:38333,0662,790,049,3982,697,483,00066,962,0002,273,280
5Jun 22, 2025 08:38333,1122,790,703,2602,712,850,00051,977,0002,383,872
6Jun 22, 2025 08:38333,1272,791,563,4892,710,979,00053,979,0002,273,280
7Jun 22, 2025 08:38333,1452,790,524,2942,697,125,00067,977,0002,273,280
8Jun 22, 2025 08:38333,2762,795,035,6402,710,207,00055,983,0002,273,280
9Jun 22, 2025 08:38333,4952,790,313,9702,713,029,00054,980,0002,273,280