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 19, 2026 18:07A_ShamanA_ShamanScore: 44,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 18:0744,240376,300,948283,861,00083,333,0002,113,536
2Jun 19, 2026 18:0744,266376,462,095283,913,00083,502,0002,113,536
3Jun 19, 2026 18:0744,286377,093,066283,796,00083,779,0002,113,536
4Jun 19, 2026 18:0744,372377,673,754283,835,00084,459,0002,113,536
5Jun 19, 2026 18:0744,461378,186,130283,863,00085,168,0002,113,536
6Jun 19, 2026 18:0744,893381,749,136285,105,00087,510,0002,113,536
7Jun 19, 2026 18:0744,981382,472,664285,202,00088,143,0002,113,536
8Jun 19, 2026 18:0745,045383,288,069285,155,00088,721,0002,113,536
9Jun 19, 2026 18:0745,132384,030,042285,198,00089,402,0002,113,536