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:37TudyMTudyMScore: 11,227Success
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:4611,028330,850,714901,786,00028,993,0002,809,856
2Apr 27, 2026 22:4611,115333,461,232897,959,00033,960,0002,408,448
3Apr 27, 2026 22:4611,146334,394,241899,293,00031,010,0002,506,752
4Apr 27, 2026 22:4611,169335,083,121906,360,00024,009,0002,633,728
5Apr 27, 2026 22:4611,227336,815,565907,602,00030,986,0002,666,496
6Apr 27, 2026 22:4611,239337,193,768902,910,00025,025,0002,781,184
7Apr 27, 2026 22:4611,265337,963,022896,231,00033,008,0002,424,832
8Apr 27, 2026 22:4611,705351,158,432940,625,00027,988,0002,461,696
9Apr 27, 2026 22:4611,846355,381,520934,278,00030,976,0002,658,304