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 listAug 3, 2025 14:52Trinh The SonTrinh The SonScore: 2,067,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2025 14:522,064,94117,174,266,99917,082,033,00056,976,0002,260,992
2Aug 3, 2025 14:522,065,13017,169,740,02517,069,607,00070,969,0002,277,376
3Aug 3, 2025 14:522,065,59017,172,858,72717,088,422,00055,978,0002,277,376
4Aug 3, 2025 14:522,066,10817,181,858,51417,087,719,00060,974,0002,277,376
5Aug 3, 2025 14:522,067,37017,194,960,28817,072,215,00086,960,0002,289,664
6Aug 3, 2025 14:522,067,52317,190,354,51117,090,469,00069,969,0002,289,664
7Aug 3, 2025 14:522,068,50017,203,039,62417,103,581,00064,968,0002,277,376
8Aug 3, 2025 14:522,069,90117,213,079,11317,121,212,00058,969,0002,281,472
9Aug 3, 2025 14:522,124,29717,664,358,72817,561,696,00069,970,0002,269,184