Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 27, 2026 22:07TudyMTudyMScore: 15,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 22:1015,212456,376,5091,248,836,00045,993,0002,723,840
2Apr 27, 2026 22:1015,279458,388,5891,256,752,00038,022,0002,785,280
3Apr 27, 2026 22:1015,311459,340,0051,294,017,00038,940,0002,654,208
4Apr 27, 2026 22:1015,504465,145,8541,291,771,00042,925,0002,854,912
5Apr 27, 2026 22:1015,516465,482,3501,290,999,00040,936,0002,908,160
6Apr 27, 2026 22:1015,612468,368,9101,286,680,00043,954,0002,945,024
7Apr 27, 2026 22:1015,669470,093,5221,291,466,00038,953,0002,605,056
8Apr 27, 2026 22:1015,683470,516,8561,283,453,00050,899,0002,809,856
9Apr 27, 2026 22:1015,759472,787,3851,281,979,00051,918,0002,850,816