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 22, 2026 01:15olliecrowolliecrowScore: 31,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 01:1731,264937,942,7752,752,870,0008,993,0002,367,488
2Apr 22, 2026 01:1731,299938,978,2622,754,988,0009,992,0002,527,232
3Apr 22, 2026 01:1731,379941,382,7912,755,070,00010,988,0002,805,760
4Apr 22, 2026 01:1731,427942,834,1472,761,985,0008,993,0002,375,680
5Apr 22, 2026 01:1731,435943,067,1032,759,011,0008,996,0002,469,888
6Apr 22, 2026 01:1731,457943,710,2132,761,499,0009,994,0002,367,488
7Apr 22, 2026 01:1731,489944,695,9372,761,203,0009,989,0002,482,176
8Apr 22, 2026 01:1731,605948,179,0832,781,375,0008,997,0002,543,616
9Apr 22, 2026 01:1731,832954,989,3972,790,730,0008,995,0002,543,616