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 29, 2026 14:17TudyMTudyMScore: 10,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 14:1910,663319,916,987862,446,00018,987,0002,809,856
2Apr 29, 2026 14:1910,705321,156,333863,328,00017,986,0002,678,784
3Apr 29, 2026 14:1910,794323,828,942867,534,00013,008,0002,813,952
4Apr 29, 2026 14:1910,870326,121,281864,553,00015,991,0002,678,784
5Apr 29, 2026 14:1910,905327,159,086866,169,00014,002,0002,818,048
6Apr 29, 2026 14:1911,178335,340,068914,683,00019,993,0002,543,616
7Apr 29, 2026 14:1911,195335,860,202914,067,00016,982,0002,842,624
8Apr 29, 2026 14:1911,242337,273,967916,298,00016,986,0002,936,832
9Apr 29, 2026 14:1911,443343,294,362915,859,00017,997,0002,805,760