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 24, 2026 02:56olliecrowolliecrowScore: 6,144Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 02:565,818174,560,101437,934,00010,021,0002,445,312
2Apr 24, 2026 02:565,970179,112,463433,376,00010,984,0002,822,144
3Apr 24, 2026 02:566,076182,299,025446,635,00010,991,0002,678,784
4Apr 24, 2026 02:566,087182,618,335446,432,00010,009,0002,670,592
5Apr 24, 2026 02:566,144184,328,521449,333,00010,007,0002,674,688
6Apr 24, 2026 02:566,166184,993,680447,841,0009,996,0002,678,784
7Apr 24, 2026 02:566,202186,065,621447,219,00010,004,0002,957,312
8Apr 24, 2026 02:566,242187,289,332448,335,0007,970,0002,457,600
9Apr 24, 2026 02:566,249187,493,784449,010,00010,000,0002,785,280