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 12:37Aliaksandr MikheiAliaksandr MikheiScore: 74,001Success
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 12:3773,856636,373,520546,007,00067,000,0002,285,568
2Nov 12, 2025 12:3773,891641,198,107554,266,00059,028,0002,510,848
3Nov 12, 2025 12:3773,900644,706,344551,330,00062,037,0002,277,376
4Nov 12, 2025 12:3773,966640,740,450562,923,00050,993,0002,285,568
5Nov 12, 2025 12:3774,001643,291,910550,185,00064,021,0002,289,664
6Nov 12, 2025 12:3774,002636,162,792556,196,00058,020,0002,506,752
7Nov 12, 2025 12:3774,009638,642,955554,247,00060,026,0002,285,568
8Nov 12, 2025 12:3774,063637,442,160557,746,00056,974,0002,260,992
9Nov 12, 2025 12:3774,087638,044,951554,930,00059,992,0002,285,568