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 23, 2025 22:17Valentin KofmanValentin KofmanScore: 8,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 22:177,30487,593,37759,613,0001,010,0002,289,664
2Jun 23, 2025 22:177,32787,839,70059,818,000996,0002,269,184
3Jun 23, 2025 22:177,33483,665,72959,873,000997,0002,289,664
4Jun 23, 2025 22:178,07190,852,38064,988,0001,999,0002,289,664
5Jun 23, 2025 22:178,08390,755,55866,086,0001,001,0002,265,088
6Jun 23, 2025 22:178,10790,992,49465,276,0002,008,0002,289,664