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 listMar 4, 2026 00:41olliecrowolliecrowScore: 10,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 00:4110,696320,884,418846,641,0008,985,0002,646,016
2Mar 4, 2026 00:4110,726321,768,304847,369,00010,991,0002,617,344
3Mar 4, 2026 00:4110,787323,619,249849,157,0009,990,0002,404,352
4Mar 4, 2026 00:4110,808324,250,725853,962,0009,999,0002,650,112
5Mar 4, 2026 00:4110,863325,880,681844,211,00010,002,0002,846,720
6Mar 4, 2026 00:4110,870326,110,897855,101,0009,977,0002,572,288
7Mar 4, 2026 00:4110,954328,608,217852,246,0009,979,0002,347,008
8Mar 4, 2026 00:4110,965328,937,075854,171,00011,002,0002,760,704
9Mar 4, 2026 00:4110,980329,412,429849,430,00011,005,0002,842,624