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 28, 2026 21:51Victor MerckléVictor MerckléScore: 14,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 21:5614,663439,903,287715,872,000106,831,0002,686,976
2Apr 28, 2026 21:5614,783443,494,616715,769,000108,812,0002,383,872
3Apr 28, 2026 21:5614,849445,484,419715,300,000113,888,0002,420,736
4Apr 28, 2026 21:5614,862445,872,035709,870,000111,136,0002,691,072
5Apr 28, 2026 21:5614,954448,621,180713,661,000109,947,0002,502,656
6Apr 28, 2026 21:5614,973449,206,910716,970,000113,836,0002,334,720
7Apr 28, 2026 21:5614,981449,450,324711,177,000110,871,0002,809,856
8Apr 28, 2026 21:5615,074452,249,550713,154,000109,023,0002,912,256
9Apr 28, 2026 21:5615,174455,238,408712,618,000107,942,0002,641,920