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 10:10Victor MerckléVictor MerckléScore: 7,700Success
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 10:127,456223,703,543557,251,00019,008,0002,744,320
2Apr 28, 2026 10:127,551226,552,440558,020,00017,000,0002,744,320
3Apr 28, 2026 10:127,567227,033,345560,261,00017,976,0002,506,752
4Apr 28, 2026 10:127,589227,675,616557,096,00016,972,0002,740,224
5Apr 28, 2026 10:127,700231,020,910557,433,00017,981,0002,736,128
6Apr 28, 2026 10:127,736232,083,921563,391,00018,012,0002,740,224
7Apr 28, 2026 10:127,834235,022,988556,343,00020,012,0002,793,472
8Apr 28, 2026 10:127,845235,378,521556,520,00018,016,0002,744,320
9Apr 28, 2026 10:128,392251,780,495593,077,00017,911,0002,342,912