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 listNov 12, 2025 11:45Aliaksandr MikheiAliaksandr MikheiScore: 95,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 11:4595,819822,032,978735,278,00060,022,0002,289,664
2Nov 12, 2025 11:4595,874820,230,815740,772,00054,983,0002,285,568
3Nov 12, 2025 11:4595,895817,715,068736,935,00058,994,0002,260,992
4Nov 12, 2025 11:4595,961818,349,011730,522,00065,956,0002,277,376
5Nov 12, 2025 11:4595,967820,029,029729,564,00066,960,0002,510,848
6Nov 12, 2025 11:4595,989821,565,441738,730,00057,978,0002,285,568
7Nov 12, 2025 11:4596,050828,028,812736,196,00061,016,0002,510,848
8Nov 12, 2025 11:4596,080825,126,101728,513,00068,953,0002,510,848
9Nov 12, 2025 11:4596,117822,243,778741,790,00055,984,0002,510,848