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 23:01TudyMTudyMScore: 23,668Success
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 23:0823,484704,523,1872,024,370,00032,037,0003,055,616
2Apr 27, 2026 23:0823,554706,646,1532,033,057,00021,989,0002,596,864
3Apr 27, 2026 23:0823,568707,045,5422,032,938,00022,987,0002,605,056
4Apr 27, 2026 23:0823,632708,970,4992,035,034,00023,000,0002,859,008
5Apr 27, 2026 23:0823,668710,064,7192,035,718,00022,974,0002,625,536
6Apr 27, 2026 23:0823,741712,244,3262,030,600,00028,980,0002,830,336
7Apr 27, 2026 23:0824,620738,606,8452,122,925,00022,977,0002,383,872
8Apr 27, 2026 23:0824,651739,538,8652,130,352,00025,992,0002,891,776
9Apr 27, 2026 23:0826,161784,849,8072,094,994,00022,988,0002,646,016