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 29, 2026 15:51TudyMTudyMScore: 10,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 15:5210,637319,117,343863,908,00014,998,0002,670,592
2Apr 29, 2026 15:5210,656319,690,318862,185,00018,982,0002,646,016
3Apr 29, 2026 15:5210,697320,938,298872,120,00019,024,0002,654,208
4Apr 29, 2026 15:5210,710321,306,722865,552,00015,991,0002,895,872
5Apr 29, 2026 15:5210,763322,911,795868,912,00018,976,0002,433,024
6Apr 29, 2026 15:5210,911327,337,321865,293,00018,984,0002,859,008
7Apr 29, 2026 15:5211,202336,085,441917,606,00016,992,0002,596,864
8Apr 29, 2026 15:5211,288338,653,262923,598,00011,981,0002,785,280
9Apr 29, 2026 15:5211,318339,544,090921,613,00015,975,0002,723,840