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 listDec 23, 2024 02:45Christopher MullinsChristopher MullinsScore: 92,571Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2024 02:4592,553798,074,278764,194,0003,995,0002,482,176
2Dec 23, 2024 02:4592,565795,066,211766,293,0002,000,0002,486,272
3Dec 23, 2024 02:4592,568792,787,638767,313,0001,000,0002,322,432
4Dec 23, 2024 02:4592,570800,705,073768,335,00002,494,464
5Dec 23, 2024 02:4592,571795,033,434766,341,0002,000,0002,322,432
6Dec 23, 2024 02:4592,588796,147,872766,479,0001,998,0002,322,432
7Dec 23, 2024 02:4592,593794,185,005765,523,0002,998,0002,322,432
8Dec 23, 2024 02:4592,626798,553,902766,796,0002,002,0002,322,432
9Dec 23, 2024 02:4592,654795,361,380766,029,0003,000,0002,322,432