Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listApr 23, 2025 16:52KeefeKeefeScore: 77,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2025 16:5277,1232,577,951,4322,526,067,00018,992,0002,506,752
2Apr 23, 2025 16:5277,1702,577,588,3012,522,631,00023,986,0002,400,256
3Apr 23, 2025 16:5277,2862,581,577,3472,524,445,00025,984,0002,256,896
4Apr 23, 2025 16:5277,4522,585,549,7162,527,921,00027,988,0002,273,280
5Apr 23, 2025 16:5277,5762,584,181,3562,536,014,00023,990,0002,519,040
6Apr 23, 2025 16:5277,9452,604,742,1592,551,210,00020,985,0002,338,816
7Apr 23, 2025 16:5278,0722,608,221,5932,553,392,00022,985,0002,273,280
8Apr 23, 2025 16:5278,0792,607,711,9622,551,624,00024,986,0002,387,968
9Apr 23, 2025 16:5278,7512,626,288,3062,575,810,00022,989,0002,506,752