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 18:19Victor MerckléVictor MerckléScore: 20,883Success
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 18:2020,653619,610,114502,360,000101,870,0002,510,848
2Apr 28, 2026 18:2020,778623,341,350502,407,000100,880,0002,510,848
3Apr 28, 2026 18:2020,811624,332,279502,491,000102,895,0002,555,904
4Apr 28, 2026 18:2020,817624,525,141504,737,000100,947,0002,519,040
5Apr 28, 2026 18:2020,883626,498,238503,084,000103,811,0002,740,224
6Apr 28, 2026 18:2020,892626,779,394503,577,000102,913,0002,535,424
7Apr 28, 2026 18:2020,913627,416,717501,463,000106,885,0002,736,128
8Apr 28, 2026 18:2021,006630,199,237506,877,000105,974,0002,736,128
9Apr 28, 2026 18:2021,280638,421,811507,884,000109,975,0002,527,232