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 4, 2025 04:58does it really matter?does it really matter?Score: 2,066,375Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2025 04:582,065,25817,175,261,33217,071,671,00069,969,0002,277,376
2Jun 4, 2025 04:582,065,86717,180,446,96817,095,723,00050,975,0002,277,376
3Jun 4, 2025 04:582,066,29817,182,713,84617,092,302,00057,973,0002,285,568
4Jun 4, 2025 04:582,066,34817,190,697,04817,088,721,00061,969,0002,277,376
5Jun 4, 2025 04:582,066,37517,188,547,04317,080,947,00069,967,0002,277,376
6Jun 4, 2025 04:582,067,07617,184,556,11517,086,758,00069,970,0002,277,376
7Jun 4, 2025 04:582,070,81717,220,168,08017,125,811,00061,973,0002,277,376
8Jun 4, 2025 04:582,073,59917,245,505,46817,153,902,00056,973,0002,277,376
9Jun 4, 2025 04:582,206,20118,350,287,39718,249,494,00061,974,0002,277,376