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 21, 2026 17:12olliecrowolliecrowScore: 6,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 17:156,370191,100,877489,179,0008,966,0002,686,976
2Apr 21, 2026 17:156,378191,368,422486,301,0009,985,0002,674,688
3Apr 21, 2026 17:156,399191,995,866484,661,0009,972,0002,732,032
4Apr 21, 2026 17:156,435193,064,748486,807,00011,018,0002,678,784
5Apr 21, 2026 17:156,462193,877,163492,821,0009,976,0002,678,784
6Apr 21, 2026 17:156,477194,336,987493,256,0008,968,0002,940,928
7Apr 21, 2026 17:156,490194,710,060494,098,0007,985,0002,441,216
8Apr 21, 2026 17:156,501195,035,586494,222,0008,967,0002,666,496
9Apr 21, 2026 17:156,553196,606,776493,468,0008,972,0002,801,664